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.
Parallel Algorithms and Architectures [[electronic resource] ] : International Workshop Suhl, GDR, May 25-30, 1987; Proceedings / / edited by Andreas Albrecht, Hermann Jung, Kurt Mehlhorn
| Parallel Algorithms and Architectures [[electronic resource] ] : International Workshop Suhl, GDR, May 25-30, 1987; Proceedings / / edited by Andreas Albrecht, Hermann Jung, Kurt Mehlhorn |
| Edizione | [1st ed. 1987.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987 |
| Descrizione fisica | 1 online resource (IX, 200 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computation by Abstract Devices |
| ISBN | 3-540-47760-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Deterministic simulation of idealized parallel computers on more realistic ones -- Convex hull of randomly chosen points from a polytope -- Dataflow computing -- Parallel in sequence — Towards the architecture of an elementary cortical processor -- Parallel algorithms and static analysis of parallel programs -- Parallel processing of combinatorial search trees -- An O(nlogn) cost parallel algorithm for the single function coarsest partition problem -- Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region -- RELACS — A recursive layout computing system -- Parallel linear conflict-tree subtree access -- A formal definition for systolic systems -- Parallel recognition of outerplanar graphs -- Solutions for the distributed termination problem -- Memories for parallel subtree-access -- Synapse: A multi-microprocessor lisp machine with parallel garbage collector -- A note on optimal parallel transformations of regular expressions to nondeterministic finite automata -- Optimal parallel parsing of bracket languages -- On reliable networks from unreliable gates -- Area-time tradeoffs for selection -- Optimization of special permutation networks using simple algebraic relations -- Computing a rectilinear steiner minimal tree in ^{O(\sqrt n )} time -- What can be parallelized in computational geometry? -- A co-operative programming environment for a back-end type sequential inference machine CHI. |
| Record Nr. | UNISA-996465831103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
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 | ||
| ||