Listing 1 - 4 of 4 |
Sort by
|
Choose an application
Software developers and computer scientists have eagerly awaited this comprehensive revision of Robert Sedgewick's landmark texts on algorithms for C++. Sedgewick has completely revamped all five sections, illuminating today's best algorithms for an exceptionally wide range of tasks. This shrink-wrapped package brings together Algorithms in C++, Third Edition, Parts 1-4 and his new Algorithms in C++, Third Edition, Part 5, at a special discounted price. Together, these books are the most definitive, up-to-date, and practical algorithms resource available. The first book introduces fundamental concepts associated with algorithms, then covers data structures, sorting, and searching. The second book focuses entirely on graphing algorithms, which are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. Sedgewick focuses on practical applications, giving readers all the information, diagrams, and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he presents. Together these books present nearly 2,000 new exercises, hundreds of new figures, and dozens of new programs.
C (Computer program language) --- Computer algorithms --- 681.3*F2 --- 681.3*I12 --- 681.3*I12 Algorithms: algebraic algorithms; nonalgebraic algorithms; analysis of algorithms (Algebraic manipulation; computing methodologies) --- Algorithms: algebraic algorithms; nonalgebraic algorithms; analysis of algorithms (Algebraic manipulation; computing methodologies) --- Algorithms --- 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} --- Programming --- Computer science --- Basic Sciences. Mathematics -- Numerical Mathematics. --- C (Langage de programmation) --- Algorithmes --- 681.3*D15 --- 681.3*G22 --- 681.3*D15 Software: object-oriented programming --- Software: object-oriented programming --- 681.3*G22 Graph theory: graph algorithms; network problems; path and tree problems; trees--See also {681.3*F22} --- Graph theory: graph algorithms; network problems; path and tree problems; trees--See also {681.3*F22}
Choose an application
Introduced 160 years ago as an attempt to generalize complex numbers to higher dimensions, quaternions are now recognized as one of the most important concepts in modern computer graphics. They offer a powerful way to represent rotations and compared to rotation matrices they use less memory, compose faster, and are naturally suited for efficient interpolation of rotations. Despite this, many practitioners have avoided quaternions because of the mathematics used to understand them, hoping that some day a more intuitive description will be available.The wait is over. Andrew Hanson's new boo
Quaternions. --- Algebra, Universal --- Algebraic fields --- Curves --- Surfaces --- Numbers, Complex --- Vector analysis --- Quaternions --- 681.3*I35 --- 681.3*I35 Computational geometry and object modeling (Computer graphics) --- Computational geometry and object modeling (Computer graphics) --- Computer graphics.
Choose an application
De Gulden Snede is een verhouding die al twee en een half duizend jaar, sinds de Oude Grieken, een bijzondere plaats heeft in de wiskunde. Zo'n 800 jaar geleden ontdekte Fibonacci zijn beroemde rij. Het blijkt dat er vele, vaak verrassende, verbanden bestaan tussen de Gulden Snede en de rij van Fibonacci. De eerste helft van dit boekje behandelt de eigenschappen van deze verhouding en rij, en hun onderlinge relaties. De Gulden Snede en de rij van Fibonacci zijn niet alleen wiskundig fascinerend, maar ze duiken ook op de meest onverwachte plekken op. Zo zijn er toepassingen te vinden in de beeldende kunst, de architectuur en in de natuur. De tweede helft van dit boekje bevat 7 opdrachten, waarin deze toepassingen worden besproken en nader onderzocht kunnen worden. (Bron: covertekst)
510 --- Gulden snede. --- Didactics of secundary education --- geometrie --- algebra --- Didactics of mathematics --- Algebraic geometry --- wiskunde --- Gulden snede --- 51-7 --- meetkunde --- gulden snede --- kunst --- 485.3 --- 51 <075> --- Algebra --- Meetkunde --- Wiskunde --- 51-7 Mathematical studies and methods in other sciences. Scientific mathematics. Actuarial mathematics. Biometrics. Econometrics etc. --- Mathematical studies and methods in other sciences. Scientific mathematics. Actuarial mathematics. Biometrics. Econometrics etc. --- 51 <075> Mathematics--Schoolboeken --- Mathematics--Schoolboeken --- didactiek secundair onderwijs - wiskunde --- 505 --- 510.3 --- 510.30 --- Fibonacci --- Kunst --- Secundair onderwijs --- Filosofie der natuurwetenschappen --- Inleidingen - Hand- en leerboeken Wiskunde --- Schoolbooks - Didactic material --- (zie ook: realistische wiskunde)
Choose an application
Cellular automata. --- Computational complexity. --- Automates cellulaires --- Complexité de calcul (Informatique) --- Cellular automata --- Computational complexity --- #SBIB:316.23H1 --- #SBIB:316.23H2 --- #SBIB:16G --- #WSCH:AAS2 --- 5 --- 519.6 --- 004 --- 51 --- 681.3*F41 --- 681.3*F42 --- 681.3*F43 --- wetenschap --- wetenschapstheorie --- computers --- wiskunde --- fysica --- biologie --- Complexity, Computational --- Electronic data processing --- Machine theory --- Computers, Iterative circuit --- Iterative circuit computers --- Structures, Tessellation (Automata) --- Tessellation structures (Automata) --- Parallel processing (Electronic computers) --- Pattern recognition systems --- Sequential machine theory --- Kennissociologie --- Sociologie van de wetenschappen --- Logica en wetenschapsleer --- Wetenschappen --- Computerwiskunde --- Computerkunde --- Wiskunde --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Grammars and other rewriting systems: decision problems; grammar types; parallel rewriting systems; parsing; thue systems (Mathematical logic and formal languages)--See also {681.3*D31} --- Formal languages: algebraic language theory; classes defined by grammars or automata or by resource-bounded automata; operations on languages (Mathematical logic and formal languages)--See also {681.3*D31} --- Cellulaire automaten --- Complexiteit van berekening --- Cellulaire automaten. --- Complexiteit van berekening. --- 681.3*F43 Formal languages: algebraic language theory; classes defined by grammars or automata or by resource-bounded automata; operations on languages (Mathematical logic and formal languages)--See also {681.3*D31} --- 681.3*F42 Grammars and other rewriting systems: decision problems; grammar types; parallel rewriting systems; parsing; thue systems (Mathematical logic and formal languages)--See also {681.3*D31} --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Computational Complexity --- Complexité de calcul (Informatique) --- Systèmes, Conception de --- System design --- System design. --- Systèmes, Conception de
Listing 1 - 4 of 4 |
Sort by
|