Wyniki wyszukiwania:
wyszukanych pozycji: 21
 |
Algorithmic Adventures: From Knowledge to Magic
ISBN: 9783540859857 / Angielski / Twarda / 2009 / 380 str. Termin realizacji zamówienia: ok. 20 dni roboczych. The author of this book invites the reader to explore the science of computing. He is convinced that a good explanation of even the most basic techniques can demonstrate the power and magic of the underlying principles. His book is a fascinating read.
The author of this book invites the reader to explore the science of computing. He is convinced that a good explanation of even the most basic techniq...
|
cena:
214,97 zł |
 |
Teaching Fundamental Concepts of Informatics
ISBN: 9783642113758 / Angielski / Miękka / 2010 / 205 str. Termin realizacji zamówienia: ok. 20 dni roboczych. The International Conference on Informatics in Secondary Schools: Evolution and Perspective (ISSEP) is an emerging forum for researchers and practitioners in the area of computer science education with a focus on secondary schools. The ISSEP series started in 2005 in Klagenfurt, and continued in 2006 in Vilnius, and in 2008 in Torun. The 4th ISSEP took part in Zurich. This volume presents 4 of the 5 invited talks and 14 regular contributions chosen from 32 submissions to ISSEP 2010. The ISSEP conference series is devoted to all aspects of computer science teaching. In the preface of the...
The International Conference on Informatics in Secondary Schools: Evolution and Perspective (ISSEP) is an emerging forum for researchers and practitio...
|
cena:
195,42 zł |
 |
Algorithmic Adventures: From Knowledge to Magic
ISBN: 9783642426063 / Angielski / Miękka / 2014 / 363 str. Termin realizacji zamówienia: ok. 20 dni roboczych. The ?rst and foremost goal of this lecture series was to show the beauty, depth and usefulness of the key ideas in computer science. While working on the 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 and changes our view on the world, that contributes to our understanding of the fundamental concepts of science and that sheds new light on and brings...
The ?rst and foremost goal of this lecture series was to show the beauty, depth and usefulness of the key ideas in computer science. While working on ...
|
cena:
214,97 zł |
 |
Berechenbarkeit: Logik, Argumentation, Rechner Und Assembler, Unendlichkeit, Grenzen Der Automatisierbarkeit Lehrbuch Für Unterricht Un
ISBN: 9783834815095 / Niemiecki / Miękka / 2011 / 265 str. Termin realizacji zamówienia: ok. 20 dni roboczych. Die Bildung der grundlegenden Begriffe und Konzepte der Informatik und der Mathematik wie Programm, Algorithmus, Beweis und Argumentation, Unendlichkeit und die Grenzen der Automatisierbarkeit werden ohne Vorwissen des Lesers in der Informatik in kleinen Schritten vermittelt.
Die Bildung der grundlegenden Begriffe und Konzepte der Informatik und der Mathematik wie Programm, Algorithmus, Beweis und Argumentation, Unendlichke...
|
cena:
138,78 zł |
 |
Communication Complexity and Parallel Computing: The Application of Communication Complexity in Parallel Computing
ISBN: 9783540574590 / Angielski / Twarda / 1997 / 336 str. Termin realizacji zamówienia: ok. 20 dni roboczych. The communication complexity of two-party protocols is an only 15 years old complexity measure, but it is already considered to be one of the fundamen- tal complexity measures of recent complexity theory. Similarly to Kolmogorov complexity in the theory of sequential computations, communication complex- ity is used as a method for the study of the complexity of concrete computing problems in parallel information processing. Especially, it is applied to prove lower bounds that say what computer resources (time, hardware, memory size) are necessary to compute the given task. Besides the...
The communication complexity of two-party protocols is an only 15 years old complexity measure, but it is already considered to be one of the fundamen...
|
cena:
195,42 zł |
 |
Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
ISBN: 9783642079092 / Angielski / Miękka / 2010 / 538 str. Termin realizacji zamówienia: ok. 20 dni roboczych. Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech- nologies. Because of this, the design of algorithms for solving hard problems is the core of current algorithmic research from the theoretical point of view as well as from the practical point of view. There are many general text books on algorithmics, and several specialized books devoted to particular approaches such as local search, randomization, approximation algorithms, or heuristics. But there is no textbook that focuses on the design...
Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech...
|
cena:
254,06 zł |
 |
Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography
ISBN: 9783540140153 / Angielski / Twarda / 2003 / 313 str. Termin realizacji zamówienia: ok. 20 dni roboczych. This textbook not only provides an elegant route through the theoretical fundamentals of computer science, it also shows that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles, depth of research, and yet directly applicable. It presents the development of the computer scientist's way of thinking: detailing such classic areas as computability and automata theory as well as such fundamental concepts as approximation and randomization in algorithmics. Coverage also explains the basic ideas of cryptography and interconnection network... This textbook not only provides an elegant route through the theoretical fundamentals of computer science, it also shows that theoretical computer ... |
cena:
390,87 zł |
 |
Einführung in Die Programmierung Mit LOGO: Lehrbuch Für Unterricht Und Selbststudium
ISBN: 9783658048310 / Niemiecki / Miękka / 2014 / 259 str. Termin realizacji zamówienia: ok. 20 dni roboczych. Dieses Lehrbuch ermoglicht einen begeisterten Einstieg ins Programmieren ab 10 Jahren. Programmierunterricht wird dabei als Forderung der konstruktiven Losungsfahigkeit und der exakten Kommunikation zur Steuerung eines Computers verstanden. Die Schuler entdecken und entwickeln die Programmiersprache selbststandig mit und lernen, Aufgaben systematisch zu losen. Beginnend mit einzelnen Anweisungen werden einfache Programme spielerisch eingefuhrt. Das Buch zeichnet sich aus durch seine detaillierten Erklarungen und anschaulichen Darstellungen. Die Programmierumgebung sowie die Arbeitshefte... Dieses Lehrbuch ermoglicht einen begeisterten Einstieg ins Programmieren ab 10 Jahren. Programmierunterricht wird dabei als Forderung der konstrukt... |
cena:
138,78 zł |
 |
Theoretische Informatik: Formale Sprachen, Berechenbarkeit, Komplexitätstheorie, Algorithmik, Kommunikation Und Kryptographie
ISBN: 9783834806505 / Niemiecki / Miękka / 2010 / 415 str. Termin realizacji zamówienia: ok. 20 dni roboczych. Das Buch versteht sich als einfache Einfuhrung in die grundlegenden algorithmischen Konzepte der Informatik. Die Konzepte werden in ihrer historischen Entwicklung und in grosseren Zusammenhangen dargestellt, um so die eigentliche Faszination der Informatik, die viel kontraintuitive Uberraschungen bereithalt, zu wecken."
Das Buch versteht sich als einfache Einfuhrung in die grundlegenden algorithmischen Konzepte der Informatik. Die Konzepte werden in ihrer historischen...
|
cena:
164,38 zł |
 |
Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
ISBN: 9783540441342 / Angielski / Twarda / 2002 / 538 str. Termin realizacji zamówienia: ok. 20 dni roboczych. Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech- nologies. Because of this, the design of algorithms for solving hard problems is the core of current algorithmic research from the theoretical point of view as well as from the practical point of view. There are many general text books on algorithmics, and several specialized books devoted to particular approaches such as local search, randomization, approximation algorithms, or heuristics. But there is no textbook that focuses on the design...
Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech...
|
cena:
351,78 zł |
 |
Theoretische Informatik: Formale Sprachen, Berechenbarkeit, Komplexitätstheorie, Algorithmik, Kommunikation Und Kryptographie
ISBN: 9783658064327 / Niemiecki / Miękka / 2014 / 349 str. Termin realizacji zamówienia: ok. 20 dni roboczych. Das Ziel dieses Buches ist es, den Leser an den Grundlagen der Informatik zu begeistern. Um dies zu erreichen, bieten wir auer der ublichen rigorosen und detaillierten Prasentation eine leicht verstandliche und anschauliche Darstellung der Grundkonzepte und Ideen und erweitern die klassischen Themen wie Berechenbarkeit und Komplexitat um die faszinierenden Errungenschaften neuer Gebiete wie Randomisierung, Kryptographie und Kommunikation in Netzen.
Das Ziel dieses Buches ist es, den Leser an den Grundlagen der Informatik zu begeistern. Um dies zu erreichen, bieten wir auer der ublichen rigorosen ...
|
cena:
219,19 zł |
 |
Randomisierte Algorithmen: Methoden Zum Entwurf Von Zufallsgesteuerten Systemen Für Einsteiger
ISBN: 9783519004707 / Niemiecki / Miękka / 2004 / 310 str. Termin realizacji zamówienia: ok. 20 dni roboczych. Zufall ist ein erfolgreiches Mittel fur Entwurf und Entwicklung vieler Systeme in Informatik und Technik. Zufallsgesteuerte Algorithmen sind oft effizienter, einfacher, preiswerter und uberraschenderweise auch zuverlassiger als die besten deterministischen Programme.
Warum ist die Zufallssteuerung so erfolgreich und wie entwirft man randomisierte Systeme? Einfach, intuitiv und trotzdem formal prazise gibt dieses Buch dem Leser einen Einstieg in die wunderbare Welt zufallsgesteuerter Algorithmen." Zufall ist ein erfolgreiches Mittel fur Entwurf und Entwicklung vieler Systeme in Informatik und Technik. Zufallsgesteuerte Algorithmen sind oft effiz...
|
cena:
182,64 zł |
 |
Sieben Wunder Der Informatik: Eine Reise an Die Grenze Des Machbaren Mit Aufgaben Und Lösungen
ISBN: 9783835101722 / Niemiecki / Miękka / 2008 / 360 str. Termin realizacji zamówienia: ok. 20 dni roboczych. Sieben Wunder der Informatik immer mehr in Richtung anderer Priori- ten. Ich wollte das Entstehen der Informatik und ihre Entwicklung als eine spannende Geschichte erzahlen. Und zwar nicht als Geschichte einer isolierten Wissenschaft, sondern einer Wissenschaft, die untrennbar mit anderen W- senschaften verbunden ist, die aus Kenntnissen und Forschungsergebnissen anderer Gebiete schopft und die andere Wissenschaften durch ihre Errung- schaften bereichert. Meine Idee war es, dass man auf diese Weise durch das Beispiel der Informatik zusatzlich mehr Verstandnis fur die Art und Weise gewinnen...
Sieben Wunder der Informatik immer mehr in Richtung anderer Priori- ten. Ich wollte das Entstehen der Informatik und ihre Entwicklung als eine spannen...
|
cena:
138,78 zł |
 |
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance
ISBN: 9783540008460 / Angielski / Twarda / 2005 / 364 str. Termin realizacji zamówienia: ok. 20 dni roboczych. Preface Due to the development of hardware technologies (such as VLSI) in the early 1980s, the interest in parallel and distributive computing has been rapidly growingandinthelate1980sthestudyofparallelalgorithmsandarchitectures became one of the main topics in computer science. To bring the topic to educatorsandstudents, severalbooksonparallelcomputingwerewritten. The involvedtextbook"IntroductiontoParallelAlgorithmsandArchitectures"by F. Thomson Leighton in 1992 was one of the milestones in the development of parallel architectures and parallel algorithms. But in the last decade or so the...
Preface Due to the development of hardware technologies (such as VLSI) in the early 1980s, the interest in parallel and distributive computing has bee...
|
cena:
195,42 zł |
 |
Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography
ISBN: 9783642057298 / Angielski / Miękka / 2010 / 313 str. Termin realizacji zamówienia: ok. 20 dni roboczych. This textbook not only provides an elegant route through the theoretical fundamentals of computer science, it also shows that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles, depth of research, and yet directly applicable. It presents the development of the computer scientist's way of thinking: detailing such classic areas as computability and automata theory as well as such fundamental concepts as approximation and randomization in algorithmics. Coverage also explains the basic ideas of cryptography and interconnection network... This textbook not only provides an elegant route through the theoretical fundamentals of computer science, it also shows that theoretical computer ... |
cena:
390,87 zł |
 |
Communication Complexity and Parallel Computing
ISBN: 9783642081859 / Angielski / Miękka / 2010 / 336 str. Termin realizacji zamówienia: ok. 20 dni roboczych. The communication complexity of two-party protocols is an only 15 years old complexity measure, but it is already considered to be one of the fundamen- tal complexity measures of recent complexity theory. Similarly to Kolmogorov complexity in the theory of sequential computations, communication complex- ity is used as a method for the study of the complexity of concrete computing problems in parallel information processing. Especially, it is applied to prove lower bounds that say what computer resources (time, hardware, memory size) are necessary to compute the given task. Besides the...
The communication complexity of two-party protocols is an only 15 years old complexity measure, but it is already considered to be one of the fundamen...
|
cena:
195,42 zł |
 |
Graph-Theoretic Concepts in Computer Science: 30th International Workshop, Wg 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers
ISBN: 9783540241324 / Angielski / Miękka / 2004 / 404 str. Termin realizacji zamówienia: ok. 20 dni roboczych. This book constitutes the thoroughly refereed post-proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2004, held in Bad Honnef, Germany in June 2004. The 31 revised full papers presented together with 2 invited papers were carefully selected from 66 submissions during two rounds of reviewing and improvement. The papers are organized in topical sections on graph algorithms: trees; graph algorithms: recognition and decomposition; graph algorithms: various problems; optimization and approximation algorithms; parameterized complexity and... This book constitutes the thoroughly refereed post-proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, ... |
cena:
195,42 zł |
 |
Graph-Theoretic Concepts in Computer Science: 24th International Workshop, WG'98, Smolenice Castle, Slovak Republic, June 18-20, Proceedings
ISBN: 9783540651956 / Angielski / Miękka / 1998 / 394 str. Termin realizacji zamówienia: ok. 20 dni roboczych. This volume constitutes the thoroughly refereed post-workshop proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'98, held in Smolenice Castle, Slovak Republic, in June 1998. The 30 revised full papers presented were carefully selected from a total of 61 submissions. The papers provide a wealth of results for various classes of graphs, graph computations, graph algorithms and graph-theoretic applications in computer science.
This volume constitutes the thoroughly refereed post-workshop proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer S...
|
cena:
195,42 zł |
 |
Decoupling Control
ISBN: 9783540441281 / Angielski / Miękka / 2002 / 372 str. Termin realizacji zamówienia: ok. 20 dni roboczych. Decoupling or non-interactive control has attracted considerable research attention since the 1960s when control engineers started to deal with multivariable systems. The theory and design techniques for decoupling control have now, more or less matured for linear time-invariant systems, yet there is no single book which focuses on such an important topic. The present monograph fills this gap by presenting a fairly comprehensive and detailed treatment of decoupling theory and relevant design methods. Decoupling control under the framework of polynomial transfer function and frequency response...
Decoupling or non-interactive control has attracted considerable research attention since the 1960s when control engineers started to deal with multiv...
|
cena:
586,33 zł |
 |
Stochastic Algorithms: Foundations and Applications: 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings
ISBN: 9783540748700 / Angielski / Miękka / 2007 / 170 str. Termin realizacji zamówienia: ok. 20 dni roboczych. This book constitutes the refereed proceedings of the 4th International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2007. The nine revised full papers and five invited papers presented were carefully selected for inclusion in the book. The contributed papers included in this volume cover both theoretical as well as applied aspects of stochastic computations with a special focus on investigating the power of randomization in algorithmics. This book constitutes the refereed proceedings of the 4th International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2007... |
cena:
195,42 zł |
Czytaj nas na:
KrainaKsiazek.PL - Księgarnia Internetowa
