Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
How to think about algorithms / / Jeff Edmonds [[electronic resource]]
| How to think about algorithms / / Jeff Edmonds [[electronic resource]] |
| Autore | Edmonds Jeff <1963-> |
| Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2008 |
| Descrizione fisica | 1 online resource (xiii, 448 pages) : digital, PDF file(s) |
| Disciplina | 518/.1 |
| Soggetto topico |
Algorithms - Study and teaching
Loops (Group theory) - Study and teaching Invariants - Study and teaching Recursion theory - Study and teaching |
| ISBN |
1-107-17584-4
0-511-64579-1 9786612390289 1-282-39028-7 1-139-63726-6 0-511-80824-0 0-511-64988-6 0-511-41278-9 0-511-56800-2 0-511-41370-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Iterative algorithms: measures of progress and loop invariants -- Examples using more-of-the-input loop invariants -- Abstract data types -- Narrowing the search space: binary search -- Iterative sorting algorithms -- Euclid's GCD algorithm -- The loop invariant for lower bounds -- Abstractions, techniques, and theory -- Some simple examples of recursive algorithms -- Recursion on trees -- Recursive images -- Parsing with context-free grammars -- Definition of optimization problems -- Graph search algorithms -- Network flows and linear programming -- Greedy algorithms -- Recursive backtracking -- Dynamic programming algorithms -- Examples of dynamic programs -- Reductions and NP-completeness -- Randomized algorithms -- Existential and universal quantifiers -- Time complexity -- Logarithms and exponentials -- Asymptotic growth -- Adding-made-easy approximations -- Recurrence relations -- A formal proof of correctness. |
| Record Nr. | UNINA-9910782417503321 |
Edmonds Jeff <1963->
|
||
| Cambridge : , : Cambridge University Press, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
How to think about algorithms / / Jeff Edmonds [[electronic resource]]
| How to think about algorithms / / Jeff Edmonds [[electronic resource]] |
| Autore | Edmonds Jeff <1963-> |
| Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2008 |
| Descrizione fisica | 1 online resource (xiii, 448 pages) : digital, PDF file(s) |
| Disciplina | 518/.1 |
| Soggetto topico |
Algorithms - Study and teaching
Loops (Group theory) - Study and teaching Invariants - Study and teaching Recursion theory - Study and teaching |
| ISBN |
1-107-17584-4
0-511-64579-1 9786612390289 1-282-39028-7 1-139-63726-6 0-511-80824-0 0-511-64988-6 0-511-41278-9 0-511-56800-2 0-511-41370-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Iterative algorithms: measures of progress and loop invariants -- Examples using more-of-the-input loop invariants -- Abstract data types -- Narrowing the search space: binary search -- Iterative sorting algorithms -- Euclid's GCD algorithm -- The loop invariant for lower bounds -- Abstractions, techniques, and theory -- Some simple examples of recursive algorithms -- Recursion on trees -- Recursive images -- Parsing with context-free grammars -- Definition of optimization problems -- Graph search algorithms -- Network flows and linear programming -- Greedy algorithms -- Recursive backtracking -- Dynamic programming algorithms -- Examples of dynamic programs -- Reductions and NP-completeness -- Randomized algorithms -- Existential and universal quantifiers -- Time complexity -- Logarithms and exponentials -- Asymptotic growth -- Adding-made-easy approximations -- Recurrence relations -- A formal proof of correctness. |
| Record Nr. | UNINA-9910815901403321 |
|
Edmonds Jeff <1963->
|
||
| Cambridge : , : Cambridge University Press, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Stochastic Algorithms: Foundations and Applications [[electronic resource] ] : Third International Symposium, SAGA 2005, Moscow, Russia, October 20-22, 2005 / / edited by Oleg B. Lupanov, Oktay M. Kasim-Zade, Alexander V. Chaskin, Kathleen Steinhöfel
| Stochastic Algorithms: Foundations and Applications [[electronic resource] ] : Third International Symposium, SAGA 2005, Moscow, Russia, October 20-22, 2005 / / edited by Oleg B. Lupanov, Oktay M. Kasim-Zade, Alexander V. Chaskin, Kathleen Steinhöfel |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (VIII, 240 p.) |
| Disciplina | 518/.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Computer science—Mathematics Mathematical statistics Discrete mathematics Probabilities Theory of Computation Probability and Statistics in Computer Science Discrete Mathematics in Computer Science Probability Theory |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Systems of Containers and Enumeration Problems -- Some Heuristic Analysis of Local Search Algorithms for SAT Problems -- Clustering in Stochastic Asynchronous Algorithms for Distributed Simulations -- On Construction of the Set of Irreducible Partial Covers -- Recent Advances in Multiobjective Optimization -- Polynomial Time Checking for Generation of Finite Distributions of Rational Probabilities -- FPL Analysis for Adaptive Bandits -- On Improved Least Flexibility First Heuristics Superior for Packing and Stock Cutting Problems -- Evolutionary Testing Techniques -- Optimal Fuzzy CLOS Guidance Law Design Using Ant Colony Optimization -- On Some Bounds on the Size of Branching Programs (A Survey) -- Two Metaheuristics for Multiobjective Stochastic Combinatorial Optimization -- Self-replication, Evolvability and Asynchronicity in Stochastic Worlds -- New Computation Paradigm for Modular Exponentiation Using a Graph Model -- Dynamic Facility Location with Stochastic Demands -- The Complexity of Classical and Quantum Branching Programs: A Communication Complexity Approach -- On the Properties of Asymptotic Probability for Random Boolean Expression Values in Binary Bases -- Solving a Dynamic Cell Formation Problem with Machine Cost and Alternative Process Plan by Memetic Algorithms -- Eco-Grammar Systems as Models for Parallel Evolutionary Algorithms. |
| Record Nr. | UNISA-996466225103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Stochastic Algorithms: Foundations and Applications : Third International Symposium, SAGA 2005, Moscow, Russia, October 20-22, 2005 / / edited by Oleg B. Lupanov, Oktay M. Kasim-Zade, Alexander V. Chaskin, Kathleen Steinhöfel
| Stochastic Algorithms: Foundations and Applications : Third International Symposium, SAGA 2005, Moscow, Russia, October 20-22, 2005 / / edited by Oleg B. Lupanov, Oktay M. Kasim-Zade, Alexander V. Chaskin, Kathleen Steinhöfel |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (VIII, 240 p.) |
| Disciplina | 518/.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Computer science—Mathematics Mathematical statistics Discrete mathematics Probabilities Theory of Computation Probability and Statistics in Computer Science Discrete Mathematics in Computer Science Probability Theory |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Systems of Containers and Enumeration Problems -- Some Heuristic Analysis of Local Search Algorithms for SAT Problems -- Clustering in Stochastic Asynchronous Algorithms for Distributed Simulations -- On Construction of the Set of Irreducible Partial Covers -- Recent Advances in Multiobjective Optimization -- Polynomial Time Checking for Generation of Finite Distributions of Rational Probabilities -- FPL Analysis for Adaptive Bandits -- On Improved Least Flexibility First Heuristics Superior for Packing and Stock Cutting Problems -- Evolutionary Testing Techniques -- Optimal Fuzzy CLOS Guidance Law Design Using Ant Colony Optimization -- On Some Bounds on the Size of Branching Programs (A Survey) -- Two Metaheuristics for Multiobjective Stochastic Combinatorial Optimization -- Self-replication, Evolvability and Asynchronicity in Stochastic Worlds -- New Computation Paradigm for Modular Exponentiation Using a Graph Model -- Dynamic Facility Location with Stochastic Demands -- The Complexity of Classical and Quantum Branching Programs: A Communication Complexity Approach -- On the Properties of Asymptotic Probability for Random Boolean Expression Values in Binary Bases -- Solving a Dynamic Cell Formation Problem with Machine Cost and Alternative Process Plan by Memetic Algorithms -- Eco-Grammar Systems as Models for Parallel Evolutionary Algorithms. |
| Record Nr. | UNINA-9910483997503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Stochastic Algorithms: Foundations and Applications [[electronic resource] ] : Second International Symposium, SAGA 2003, Hatfield, UK, September 22-23, 2003, Proceedings / / edited by Andreas Albrecht, Kathleen Steinhöfel
| Stochastic Algorithms: Foundations and Applications [[electronic resource] ] : Second International Symposium, SAGA 2003, Hatfield, UK, September 22-23, 2003, Proceedings / / edited by Andreas Albrecht, Kathleen Steinhöfel |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (VIII, 172 p.) |
| Disciplina | 518/.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Probabilities
Algorithms Computers Numerical analysis Computer science—Mathematics Mathematical statistics Probability Theory and Stochastic Processes Algorithm Analysis and Problem Complexity Computation by Abstract Devices Numeric Computing Discrete Mathematics in Computer Science Probability and Statistics in Computer Science |
| ISBN | 3-540-39816-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Prospects of Quantum Informatics -- A Converging ACO Algorithm for Stochastic Combinatorial Optimization -- Optimality of Randomized Algorithms for the Intersection Problem -- Stochastic Algorithms for Gene Expression Analysis -- Analysis of a Randomized Local Search Algorithm for LDPCC Decoding Problem -- Testing a Simulated Annealing Algorithm in a Classification Problem -- Global Search through Sampling Using a PDF -- Simulated Annealing for Optimal Pivot Selection in Jacobian Accumulation -- Quantum Data Compression -- Who’sThe Weakest Link? -- On the Stochastic Open Shop Problem -- Global Optimization – Stochastic or Deterministic? -- Two-Component Traffic Modelled by Cellular Automata: Imposing Passing Restrictions on Slow Vehicles Increases the Flow -- Average-Case Complexity of Partial Boolean Functions -- Classes of Binary Rational Distributions Closed under Discrete Transformations. |
| Record Nr. | UNISA-996465796203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Stochastic Algorithms: Foundations and Applications : Second International Symposium, SAGA 2003, Hatfield, UK, September 22-23, 2003, Proceedings / / edited by Andreas Albrecht, Kathleen Steinhöfel
| Stochastic Algorithms: Foundations and Applications : Second International Symposium, SAGA 2003, Hatfield, UK, September 22-23, 2003, Proceedings / / edited by Andreas Albrecht, Kathleen Steinhöfel |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (VIII, 172 p.) |
| Disciplina | 518/.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Probabilities
Algorithms Computers Numerical analysis Computer science—Mathematics Mathematical statistics Probability Theory and Stochastic Processes Algorithm Analysis and Problem Complexity Computation by Abstract Devices Numeric Computing Discrete Mathematics in Computer Science Probability and Statistics in Computer Science |
| ISBN | 3-540-39816-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Prospects of Quantum Informatics -- A Converging ACO Algorithm for Stochastic Combinatorial Optimization -- Optimality of Randomized Algorithms for the Intersection Problem -- Stochastic Algorithms for Gene Expression Analysis -- Analysis of a Randomized Local Search Algorithm for LDPCC Decoding Problem -- Testing a Simulated Annealing Algorithm in a Classification Problem -- Global Search through Sampling Using a PDF -- Simulated Annealing for Optimal Pivot Selection in Jacobian Accumulation -- Quantum Data Compression -- Who’sThe Weakest Link? -- On the Stochastic Open Shop Problem -- Global Optimization – Stochastic or Deterministic? -- Two-Component Traffic Modelled by Cellular Automata: Imposing Passing Restrictions on Slow Vehicles Increases the Flow -- Average-Case Complexity of Partial Boolean Functions -- Classes of Binary Rational Distributions Closed under Discrete Transformations. |
| Record Nr. | UNINA-9910144044503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
