Listing 1 - 10 of 11 | << page >> |
Sort by
|
Choose an application
In recent years game theory has had a substantial impact on computer science, especially on Internet- and e-commerce-related issues. Algorithmic Game Theory, first published in 2007, develops the central ideas and results of this exciting area in a clear and succinct manner. More than 40 of the top researchers in this field have written chapters that go from the foundations to the state of the art. Basic chapters on algorithmic methods for equilibria, mechanism design and combinatorial auctions are followed by chapters on important game theory applications such as incentives and pricing, cost sharing, information markets and cryptography and security. This definitive work will set the tone of research for the next few years and beyond. Students, researchers, and practitioners alike need to learn more about these fascinating theoretical developments and their widespread practical application.
Operational research. Game theory --- Game theory --- Algorithms --- Théorie des jeux --- Algorithmes --- 519.83 --- Theory of games --- 519.83 Theory of games --- Théorie des jeux --- Games, Theory of --- Mathematical models --- Mathematics --- Algorism --- Algebra --- Arithmetic --- Foundations --- 681.3*I2 --- 681.3*I2 Artificial intelligence. AI --- Artificial intelligence. AI --- Game theory. --- Algorithms. --- Information Technology --- Computer Science (Hardware & Networks)
Choose an application
Choose an application
Choose an application
Choose an application
"Unlike other texts that cover only one aspect of the field, The Elements of Computing Systems gives students an integrated and rigorous picture of applied computer science, as it comes to play in the construction of a simple yet powerful computer systems.". "Indeed, the best way to understand how computers work is to build one from scratch, and this textbook leads students through twelve chapters and projects that gradually build a basic hardware platform and a modern software hierarchy from the ground up. In the process, the students gain hands-on knowledge of hardware architecture, operating systems, programming languages, compilers, data structures, algorithms, and software engineering. Using this constructive approach, the book exposes a significant body of computer science knowledge and demonstrates how theoretical and applied techniques taught in other courses fit into the overall picture.". "Designed to support one- or two-semester courses, the book is based on an abstraction-implementation paradigm; each chapter presents a key hardware or software abstraction, a proposed implementation that makes it concrete, and an actual project."--BOOK JACKET.
Electronic digital computers. --- Electrical & Computer Engineering --- Engineering & Applied Sciences --- Electrical Engineering --- Automatic digital computers --- Computers, Electronic digital --- Digital computers, Electronic --- hardware --- computersysteem --- virtuele machine --- Electronic digital computers
Choose an application
Many aspects of the internal and external workings of computers can be viewed as a series of communication processes. Communication complexity is the mathematical theory of such communication processes. It is also often used as an abstract model of other aspects of computation. This book surveys this mathematical theory, concentrating on the question of how much communication is necessary for any particular process. The first part of the book is devoted to the simple two-party model introduced by Yao in 1979, which is still the most widely studied model. The second part treats newer models developed to deal with more complicated communication processes. Finally, applications of these models, including computer networks, VLSI circuits, and data structures, are treated in the third part of the book. This is an essential resource for graduate students and researchers in theoretical computer science, circuits, networks and information theory.
Algebra, Boolean. --- Logic circuits. --- Computational complexity.
Choose an application
"A unique approach to teaching about hardware and software by having students build their own machine from scratch, using simple simulators provided on the companion site"--
Choose an application
Algebra, Boolean --- Logic circuits --- Computational complexity --- Algèbre de Boole --- Circuits logiques --- Complexité de calcul (Informatique)
Choose an application
Using a unique pedagogical approach, this text introduces mathematical logic by guiding students in implementing the underlying logical concepts and mathematical proofs via Python programming. This approach, tailored to the unique intuitions and strengths of the ever-growing population of programming-savvy students, brings mathematical logic into the comfort zone of these students and provides clarity that can only be achieved by a deep hands-on understanding and the satisfaction of having created working code. While the approach is unique, the text follows the same set of topics typically covered in a one-semester undergraduate course, including propositional logic and first-order predicate logic, culminating in a proof of Gödel's completeness theorem. A sneak peek to Gödel's incompleteness theorem is also provided. The textbook is accompanied by an extensive collection of programming tasks, code skeletons, and unit tests. Familiarity with proofs and basic proficiency in Python is assumed.
Choose an application
Listing 1 - 10 of 11 | << page >> |
Sort by
|