標(biāo)題: Titlebook: Algorithmic Adventures; From Knowledge to Ma Juraj Hromkovic Book 2009 Springer-Verlag Berlin Heidelberg 2009 Biocomputing.Computer.Compute [打印本頁] 作者: fungus 時(shí)間: 2025-3-21 16:16
書目名稱Algorithmic Adventures影響因子(影響力)
作者: 藝術(shù) 時(shí)間: 2025-3-22 00:09
Book 2009the lecture notes, we came to understand that one can recognize the true spirit of a scienti?c discipline only by viewing its contributions in the framework of science as a whole. We present computer science here as a fundamental science that, interacting with other scienti?c disciplines, changed an作者: 宣稱 時(shí)間: 2025-3-22 04:22
A Short Story About the Development of Computer Science or Why Computer Science Is Not a Computer Dt to know some of the goals of the basic research in computer science as well as a part of its overlap with other research disciplines. We also use this chapter to introduce all ten subjects of the following chapters in the context of the development of computer science.作者: 摻假 時(shí)間: 2025-3-22 06:07 作者: 主動(dòng)脈 時(shí)間: 2025-3-22 11:04
How to Make Good Decisions for an Unknown Future or How to Foil an Adversary,ions. The rule is that the adversary knows the proposed algorithm A and tries to design the future in such a way that A fails. Hence, the adversary is very powerful in this game. Consequently, it is not easy to find successful online strategies.作者: 表被動(dòng) 時(shí)間: 2025-3-22 16:11
Trinity College Dublin; A New Direction,lly unsolvable problems. One could think that all algorithmically unsolvable problems are so artificial that none of them is really interesting for us. Therefore, we strive to show that there are concrete problems of serious interest in practice that cannot be algorithmically solved.作者: concubine 時(shí)間: 2025-3-22 20:17 作者: 真 時(shí)間: 2025-3-22 21:43 作者: conquer 時(shí)間: 2025-3-23 02:04
https://doi.org/10.1007/978-94-011-9757-1y of the signature but nobody can fake it; one can agree on a common secret with another person in a public conversation in such a way that no listener gets any information about the secret. That and still much more is possible. Pure magic.作者: dialect 時(shí)間: 2025-3-23 07:01 作者: carbohydrate 時(shí)間: 2025-3-23 13:29 作者: TAIN 時(shí)間: 2025-3-23 16:28 作者: Humble 時(shí)間: 2025-3-23 20:38 作者: Lipoprotein(A) 時(shí)間: 2025-3-23 22:13 作者: 立即 時(shí)間: 2025-3-24 03:53
,‘Time and Chance Happen to All Men’,The known universe is finite, and most physical theories consider the world to be finite. Everything we see and each object we touch is finite. Whatever we do in reality, we come in contact with finite things only.作者: 值得贊賞 時(shí)間: 2025-3-24 09:19
https://doi.org/10.1007/978-94-011-9757-1In this chapter we aim to introduce one of the miracles of computer science. This marvel is based on a successful application of randomness in the design of efficient algorithms for apparently intractable problems.作者: 偏狂癥 時(shí)間: 2025-3-24 11:14
Infinity Is Not Equal to Infinity, or Why Infinity Is Infinitely Important in Computer Science,The known universe is finite, and most physical theories consider the world to be finite. Everything we see and each object we touch is finite. Whatever we do in reality, we come in contact with finite things only.作者: peritonitis 時(shí)間: 2025-3-24 16:10
Randomness in Nature and as a Source of Efficiency in Algorithmics,In this chapter we aim to introduce one of the miracles of computer science. This marvel is based on a successful application of randomness in the design of efficient algorithms for apparently intractable problems.作者: fetter 時(shí)間: 2025-3-24 21:34
Algorithmics, or What Have Programming and Baking in Common?,ithout undertaking the strenuous path of learning English and Russian. Similarly, one cannot understand computer science and marvel about its ideas and results if one has not mastered the fundamentals of its technical language.作者: 不可接觸 時(shí)間: 2025-3-25 01:53
,Complexity Theory or What to Do When the Energy of the Universe Doesn’t Suffice for Performing a Coowing even in scientific disciplines beyond computer science. Time complexity is the most important measure of computational complexity. It measures the number of computer instructions performed (the amount of computer work). Time complexity is usually represented as a function of the input size.作者: 斑駁 時(shí)間: 2025-3-25 04:50 作者: arcane 時(shí)間: 2025-3-25 11:30 作者: Generalize 時(shí)間: 2025-3-25 15:36 作者: 散布 時(shí)間: 2025-3-25 18:48 作者: Gudgeon 時(shí)間: 2025-3-25 20:37
Trinity College Dublin; A New Direction, natural numbers. An infinite set is exactly as large as ? if one can number the elements of . as the first one, the second one, the third one, etc. Here we aim to show that computing tasks exist that cannot be solved using any algorithm. The idea of our argument is simple. We show that the number o作者: transient-pain 時(shí)間: 2025-3-26 00:14 作者: FLOAT 時(shí)間: 2025-3-26 05:06
https://doi.org/10.1007/978-94-011-9757-1 about having a secret without revealing any small fraction of the secret; one can send a message in cipher to several receivers in such a way that they can read it only if all receivers cooperate; one can sign a document electronically in such a way that everybody is convinced about the authenticit作者: kidney 時(shí)間: 2025-3-26 12:06 作者: Hyperplasia 時(shí)間: 2025-3-26 13:47
Computing with DNA Molecules, or Biological Computer Technology on the Horizon,作者: 正常 時(shí)間: 2025-3-26 18:54 作者: 進(jìn)入 時(shí)間: 2025-3-27 00:36
Book 2009ith a big impact on the real world, full of spectacular ideas and great ch- lenges. It is an integral part of science and engineering with an above-average dynamic over the last 30 years and a high degree of interdisciplinarity. The goal of this book is not typical for popular science writing, which作者: 圓錐 時(shí)間: 2025-3-27 01:40 作者: 無表情 時(shí)間: 2025-3-27 07:33 作者: 漂泊 時(shí)間: 2025-3-27 10:57 作者: 刺耳 時(shí)間: 2025-3-27 14:28
Limits of Computability or Why Do There Exist Tasks That Cannot Be Solved Automatically by Computer natural numbers. An infinite set is exactly as large as ? if one can number the elements of . as the first one, the second one, the third one, etc. Here we aim to show that computing tasks exist that cannot be solved using any algorithm. The idea of our argument is simple. We show that the number o作者: 神化怪物 時(shí)間: 2025-3-27 20:58 作者: DENT 時(shí)間: 2025-3-27 23:40 作者: 提名 時(shí)間: 2025-3-28 04:22
How to Make Good Decisions for an Unknown Future or How to Foil an Adversary,s one can take by knowing the future. To analyze different scenarios, one considers the game between an algorithm designer and his or her adversary. The designer tries to design online algorithms and the adversary searches for problem instances for which the algorithms fail to offer reasonable solut作者: Adulterate 時(shí)間: 2025-3-28 07:53 作者: demote 時(shí)間: 2025-3-28 11:42
C. D. Sherman,K. C. Calman,S. Eckhardt,I. Elsebai,D. Firat,D. K. Hossfeld,J.-P. Paunier,B. Salvadorisystems and control theory, and related topics.? Mathematics of Complexity and Dynamical Systems is an essential reference for all those interested in mathematical complexity, from undergraduate and graduate students up through professional researchers.作者: chandel 時(shí)間: 2025-3-28 15:47
Kelvin Wei Zhern Loh,Zhenyu Hu,Tuck Wah Soongctively transporting a variety of structurally diverse anticancer drugs out of the tumor cell (Beck et al 1979; Gerlach et al 1986; Ling, 1975; Riordan and Ling, 1979). Included in this heterogeneous group of heterocyclic compounds effluxed by P-gp are antitumor antibiotics such as the anthracycline作者: Proponent 時(shí)間: 2025-3-28 21:24
,überblick,chwerpunkt bildeten. Damit wurde es z.B. m?glich, Dampfmaschinen und in der weiteren Entwicklung hocheffiziente Gasturbinen zu bauen. Damit wird deutlich, dass die technische Produktinnovation wesentlich von der Leistungsf?higkeit der Werkstoffe abh?ngt.作者: 圍裙 時(shí)間: 2025-3-29 02:57 作者: conspicuous 時(shí)間: 2025-3-29 06:06 作者: cochlea 時(shí)間: 2025-3-29 08:36
,The Miike Coal Mine and Omuta City: A Case Study of the Largest and Last Mine’s Closure in Japan,by the closures and the very real emotive realities that they face when the local mining economy dissipated. It continues the historical narrative from a macro developmental economic analysis but adds local empirical case studies based on sociological perspectives.
