Listing 1 - 10 of 52 | << page >> |
Sort by
|
Choose an application
Computer. Automation --- #TCPW P3.0 --- 681.3*F13 --- 681.3*F2 --- Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 681.3*F13 Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- Logique
Choose an application
This volume helps take some of the "mystery" out of identifying and dealing with key algorithms. Drawing heavily on the author's own real-world experiences, the book stresses design and analysis. Coverage is divided into two parts, the first being a general guide to techniques for the design and analysis of computer algorithms. The second is a reference section, which includes a catalog of the 75 most important algorithmic problems. By browsing this catalog, readers can quickly identify what the problem they have encountered is called, what is known about it, and how they should proceed if they need to solve it. This book is ideal for the working professional who uses algorithms on a daily basis and has need for a handy reference. This work can also readily be used in an upper-division course or as a student reference guide.THE ALGORITHM DESIGN MANUAL comes with a CD-ROM that contains:* a complete hypertext version of the full printed book.* the source code and URLs for all cited implementations.* over 30 hours of audio lectures on the design and analysis of algorithms are provided, all keyed to on-line lecture notes.
Computer science --- Computer algorithms --- 681.3*F2 --- Algorithms --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Computer algorithms. --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13}
Choose an application
Numerical analysis --- Computer science --- Computer algorithms --- Algorithmes --- Computer algorithms. --- 519.682 --- 681.3*F2 --- Algorithms --- Programming languages. Metalanguages --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 519.682 Programming languages. Metalanguages --- Algorithmes (Ordinateur) --- Algoritmen (Computer)
Choose an application
681.3*F13 --- Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- 681.3*F13 Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2}
Choose an application
Matching problems with preferences are all around us - they arise when agents seek to be allocated to one another on the basis of ranked preferences over potential outcomes. Efficient algorithms are needed for producing matchings that optimise the satisfaction of the agents according to their preference lists.In recent years there has been a sharp increase in the study of algorithmic aspects of matching problems with preferences, partly reflecting the growing number of applications of these problems worldwide. This book describes the most important results in this area, providing a timely upda
Computer algorithms. --- Algorithms --- Matching theory --- 681.3*F2 --- Combinatorial analysis --- Marriage theorem --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Matching theory. --- Marriage theorem. --- Computer science --- Mathematics.
Choose an application
519.681 --- Computer algorithms --- 681.3*F2 --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6} {681.3*B7} {681.3*F13} --- Analysis of algorithms and problem complexity--See also {681.3*B6} {681.3*B7} {681.3*F13} --- Algorithms --- 519.681 Theory of programming --- Theory of programming --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Computer science --- algoritmen --- systeemontwikkeling (informatica) --- informatica --- wiskunde --- Computer algorithms. --- Algorithmes
Choose an application
This text provides an intimate, highly readable tour of the sciences of complexity, which seek to explain how large-scale complex, organized, and adaptive behaviour can emerge from simple interactions among myriad individuals.
Complexity (Philosophy) --- Philosophy --- Emergence (Philosophy) --- 51 --- complexiteit --- complexiteitstheorie --- computers --- 681.3*2.13 --- 681.3*F2 --- Computerwetenschap--?*2.13 --- Analysis of algorithms and problem complexity --- Complexité (Philosophie) --- Mathematical statistics --- Philosophy of science --- Complexity (Philosophy).
Choose an application
From the Foreword: "The papers in this volume were presented at the Aegean Workshop on Computing: VLSI Algorithms and Architectures (AWOC 88), organized by the Computer Technology Institute in Patras in cooperation with ACM, EATCS, IEEE and the General Secretariat of Research and Technology (Ministry of Industry, Energy & technology of Greece). They were selected from 119 abstracts submitted in response to the program committee's call for papers and to additional invitations from John Reif. AWOC 88 took place in Corfu, Greece, June 28-July 1, 1988. AWOC 88 is the third meeting in the International Workshop on Parallel Computing & VLSI series; the first meeting took place in Amalfi, Italy, 1984, and the second at Loutraki, Greece, 1986.".
Computer science --- Computer architecture. Operating systems --- 681.3*B7 --- 681.3*F2 --- Integrated circuits (Hardware) --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Algorithms --- Computer architecture --- Integrated circuits --- Congresses. --- Very large scale integration --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 681.3*B7 Integrated circuits (Hardware) --- Electronics. --- Electronics and Microelectronics, Instrumentation. --- Electrical engineering --- Physical sciences
Choose an application
Electronic digital computers --- Algorithms --- Programmation des ordinateurs --- Algorithmes --- Programming --- Computer programming --- Computer algorithms --- 681.3*F2 --- Computers --- Electronic computer programming --- Electronic data processing --- Programming (Electronic computers) --- Coding theory --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Computer algorithms. --- Computer programming. --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Informatique --- Computer science
Choose an application
Computer algorithms --- Algorithmes --- #WSCH:AAS2 --- 681.3*F2 --- 681.3*I12 --- Algorithms --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Algorithms: algebraic algorithms; nonalgebraic algorithms; analysis of algorithms (Algebraic manipulation; computing methodologies) --- Computer algorithms. --- 681.3*I12 Algorithms: algebraic algorithms; nonalgebraic algorithms; analysis of algorithms (Algebraic manipulation; computing methodologies) --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Complexite
Listing 1 - 10 of 52 | << page >> |
Sort by
|