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.

By: Albrecht, Andreas [editor.]Contributor(s): Steinhöfel, Kathleen [editor.] | SpringerLink (Online service)Material type: TextTextLanguage: English Series: Lecture Notes in Computer Science: 2827Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2003Description: VIII, 172 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540398165Subject(s): Computer science | Computer software | Electronic data processing | Computational complexity | Algorithms | Computer Science | Algorithm Analysis and Problem Complexity | Computation by Abstract Devices | Numeric Computing | Discrete Mathematics in Computer Science | Probability and Statistics in Computer Science | AlgorithmsAdditional physical formats: Printed edition:: No titleDDC classification: 005.1 LOC classification: QA76.9.A43Online resources: Click here to access online
Contents:
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.
In: Springer eBooksSummary: The second Symposium on Stochastic Algorithms, Foundations and Applications (SAGA 2003),took place on September 22–23,2003, in Hat?eld, England.The present volume comprises 12 contributed papers and 3 invited talks. The contributed papers included in the proceedings present results in the following areas: ant colony optimization; randomized algorithmsfor the intersection problem; - cal search for constraint satisfaction problems; randomized local search methods for combinatorial optimization, in particular, simulated annealing techniques; probabilistic global search algorithms; network communication complexity; open shop scheduling; aircraft routing; traf?c control; randomized straight-line programs; and stochastic - tomata and probabilistic transformations. TheinvitedtalkbyRolandKirschnerprovidesabriefintroductiontoquantuminf- matics. The requirements and the prospects of the physical implementation of a qu- tum computer are addressed. Lucila Ohno-Machado and Winston P. Kuo describe the factors that make the an- ysis of high-throughput gene expression data especially challenging, and indicate why properly evaluated stochastic algorithms can play a particularly important role in this process. John Vaccaro et al. review a fundamental element of quantum information theory, source coding, which entails the compression of quantum data. A recent experiment that demonstrates this fundamental principle is presented and discussed. Our special thanks go to all who supported SAGA 2003, to all authors who subm- ted papers, to the members of the program committee, to the invited speakers, and to the members of the organizing committee. Andreas Albrecht Kathleen Steinhofel ¨ Organization SAGA2003wasorganizedbytheUniversityofHertfordshire,DepartmentofComputer Science, Hat?eld, Hertfordshire AL10 9AB, United Kingdom.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
No physical items for this record

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.

The second Symposium on Stochastic Algorithms, Foundations and Applications (SAGA 2003),took place on September 22–23,2003, in Hat?eld, England.The present volume comprises 12 contributed papers and 3 invited talks. The contributed papers included in the proceedings present results in the following areas: ant colony optimization; randomized algorithmsfor the intersection problem; - cal search for constraint satisfaction problems; randomized local search methods for combinatorial optimization, in particular, simulated annealing techniques; probabilistic global search algorithms; network communication complexity; open shop scheduling; aircraft routing; traf?c control; randomized straight-line programs; and stochastic - tomata and probabilistic transformations. TheinvitedtalkbyRolandKirschnerprovidesabriefintroductiontoquantuminf- matics. The requirements and the prospects of the physical implementation of a qu- tum computer are addressed. Lucila Ohno-Machado and Winston P. Kuo describe the factors that make the an- ysis of high-throughput gene expression data especially challenging, and indicate why properly evaluated stochastic algorithms can play a particularly important role in this process. John Vaccaro et al. review a fundamental element of quantum information theory, source coding, which entails the compression of quantum data. A recent experiment that demonstrates this fundamental principle is presented and discussed. Our special thanks go to all who supported SAGA 2003, to all authors who subm- ted papers, to the members of the program committee, to the invited speakers, and to the members of the organizing committee. Andreas Albrecht Kathleen Steinhofel ¨ Organization SAGA2003wasorganizedbytheUniversityofHertfordshire,DepartmentofComputer Science, Hat?eld, Hertfordshire AL10 9AB, United Kingdom.

There are no comments on this title.

to post a comment.

Implemented and Maintained by Biju Patnaik Central Library.
For any Suggestions/Query Contact to library or Email: library@nitrkl.ac.in OR bpcl-cir@nitrkl.ac.in. Ph:91+6612462103
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha