top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Stochastic Algorithms: Foundations and Applications [[electronic resource] ] : 5th International Symposium, SAGA 2009 Sapporo, Japan, October 26-28, 2009 Proceedings / / edited by Osamu Watanabe, Thomas Zeugmann
Stochastic Algorithms: Foundations and Applications [[electronic resource] ] : 5th International Symposium, SAGA 2009 Sapporo, Japan, October 26-28, 2009 Proceedings / / edited by Osamu Watanabe, Thomas Zeugmann
Edizione [1st ed. 2009.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Descrizione fisica 1 online resource (X, 221 p.)
Disciplina 519.2/2
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science
Artificial intelligence—Data processing
Probabilities
Algorithms
Computer science—Mathematics
Mathematical statistics
Theory of Computation
Data Science
Probability Theory
Probability and Statistics in Computer Science
ISBN 3-642-04944-3
Classificazione DAT 537f
MAT 605f
MAT 914f
SS 4800
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Papers -- Scenario Reduction Techniques in Stochastic Programming -- Statistical Learning of Probabilistic BDDs -- Regular Contributions -- Learning Volatility of Discrete Time Series Using Prediction with Expert Advice -- Prediction of Long-Range Dependent Time Series Data with Performance Guarantee -- Bipartite Graph Representation of Multiple Decision Table Classifiers -- Bounds for Multistage Stochastic Programs Using Supervised Learning Strategies -- On Evolvability: The Swapping Algorithm, Product Distributions, and Covariance -- A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems -- How to Design a Linear Cover Time Random Walk on a Finite Graph -- Propagation Connectivity of Random Hypergraphs -- Graph Embedding through Random Walk for Shortest Paths Problems -- Relational Properties Expressible with One Universal Quantifier Are Testable -- Theoretical Analysis of Local Search in Software Testing -- Firefly Algorithms for Multimodal Optimization -- Economical Caching with Stochastic Prices -- Markov Modelling of Mitochondrial BAK Activation Kinetics during Apoptosis -- Stochastic Dynamics of Logistic Tumor Growth.
Record Nr. UNINA-9910484658803321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Stochastic Algorithms: Foundations and Applications [[electronic resource] ] : 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings / / edited by Juraj Hromkovič, Richard Královiç, Marc Nunkesser, Peter Widmayer
Stochastic Algorithms: Foundations and Applications [[electronic resource] ] : 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings / / edited by Juraj Hromkovič, Richard Královiç, Marc Nunkesser, Peter Widmayer
Edizione [1st ed. 2007.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
Descrizione fisica 1 online resource (X, 170 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
ISBN 3-540-74871-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Papers -- On Computation and Communication with Small Bias -- Design Strategies for Minimal Perfect Hash Functions -- Hamming, Permutations and Automata -- Probabilistic Techniques in Algorithmic Game Theory -- Randomized Algorithms and Probabilistic Analysis in Wireless Networking -- Contributed Papers -- A First Step Towards Analyzing the Convergence Time in Player-Specific Singleton Congestion Games -- Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks -- Approximate Discovery of Random Graphs -- A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis -- Digit Set Randomization in Elliptic Curve Cryptography -- Lower Bounds for Hit-and-Run Direct Search -- An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata -- Stochastic Methods for Dynamic OVSF Code Assignment in 3G Networks -- On the Support Size of Stable Strategies in Random Games.
Record Nr. UNISA-996465635903316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Stochastic Algorithms: Foundations and Applications [[electronic resource] ] : 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings / / edited by Juraj Hromkovič, Richard Královiç, Marc Nunkesser, Peter Widmayer
Stochastic Algorithms: Foundations and Applications [[electronic resource] ] : 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings / / edited by Juraj Hromkovič, Richard Královiç, Marc Nunkesser, Peter Widmayer
Edizione [1st ed. 2007.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
Descrizione fisica 1 online resource (X, 170 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
ISBN 3-540-74871-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Papers -- On Computation and Communication with Small Bias -- Design Strategies for Minimal Perfect Hash Functions -- Hamming, Permutations and Automata -- Probabilistic Techniques in Algorithmic Game Theory -- Randomized Algorithms and Probabilistic Analysis in Wireless Networking -- Contributed Papers -- A First Step Towards Analyzing the Convergence Time in Player-Specific Singleton Congestion Games -- Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks -- Approximate Discovery of Random Graphs -- A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis -- Digit Set Randomization in Elliptic Curve Cryptography -- Lower Bounds for Hit-and-Run Direct Search -- An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata -- Stochastic Methods for Dynamic OVSF Code Assignment in 3G Networks -- On the Support Size of Stable Strategies in Random Games.
Record Nr. UNINA-9910484273603321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
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
Opac: Controlla la disponibilità qui
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. UNINA-9910483997503321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
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. UNINA-9910144044503321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
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
Opac: Controlla la disponibilità qui
Stochastic Algorithms: Foundations and Applications [[electronic resource] ] : International Symposium, SAGA 2001 Berlin, Germany, December 13-14, 2001 Proceedings / / edited by Kathleen Steinhöfel
Stochastic Algorithms: Foundations and Applications [[electronic resource] ] : International Symposium, SAGA 2001 Berlin, Germany, December 13-14, 2001 Proceedings / / edited by Kathleen Steinhöfel
Edizione [1st ed. 2001.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001
Descrizione fisica 1 online resource (CCXVI, 208 p.)
Disciplina 519.23
Collana Lecture Notes in Computer Science
Soggetto topico Probabilities
Algorithms
Computers
Computer science—Mathematics
Combinatorics
Mathematical statistics
Probability Theory and Stochastic Processes
Algorithm Analysis and Problem Complexity
Computation by Abstract Devices
Discrete Mathematics in Computer Science
Probability and Statistics in Computer Science
ISBN 3-540-45322-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Randomized Communication Protocols -- Optimal Mutation Rate Using Bayesian Priors for Estimation of Distribution Algorithms -- An Experimental Assessment of a Stochastic, Anytime, Decentralized, Soft Colourer for Sparse Graphs -- Randomized Branching Programs -- Yet Another Local Search Method for Constraint Solving -- An Evolutionary Algorithm for the Sequence Coordination in Furniture Production -- Evolutionary Search for Smooth Maps in Motor Control Unit Calibration -- Some Notes on Random Satisfiability -- Prospects for Simulated Annealing Algorithms in Automatic Differentiation -- Optimization and Simulation: Sequential Packing of Flexible Objects Using Evolutionary Algorithms -- Stochastic Finite Learning -- Sequential Sampling Algorithms: Unified Analysis and Lower Bounds -- Approximate Location of Relevant Variables under the Crossover Distribution.
Record Nr. UNINA-9910143917003321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Stochastic Algorithms: Foundations and Applications [[electronic resource] ] : International Symposium, SAGA 2001 Berlin, Germany, December 13-14, 2001 Proceedings / / edited by Kathleen Steinhöfel
Stochastic Algorithms: Foundations and Applications [[electronic resource] ] : International Symposium, SAGA 2001 Berlin, Germany, December 13-14, 2001 Proceedings / / edited by Kathleen Steinhöfel
Edizione [1st ed. 2001.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001
Descrizione fisica 1 online resource (CCXVI, 208 p.)
Disciplina 519.23
Collana Lecture Notes in Computer Science
Soggetto topico Probabilities
Algorithms
Computers
Computer science—Mathematics
Combinatorics
Mathematical statistics
Probability Theory and Stochastic Processes
Algorithm Analysis and Problem Complexity
Computation by Abstract Devices
Discrete Mathematics in Computer Science
Probability and Statistics in Computer Science
ISBN 3-540-45322-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Randomized Communication Protocols -- Optimal Mutation Rate Using Bayesian Priors for Estimation of Distribution Algorithms -- An Experimental Assessment of a Stochastic, Anytime, Decentralized, Soft Colourer for Sparse Graphs -- Randomized Branching Programs -- Yet Another Local Search Method for Constraint Solving -- An Evolutionary Algorithm for the Sequence Coordination in Furniture Production -- Evolutionary Search for Smooth Maps in Motor Control Unit Calibration -- Some Notes on Random Satisfiability -- Prospects for Simulated Annealing Algorithms in Automatic Differentiation -- Optimization and Simulation: Sequential Packing of Flexible Objects Using Evolutionary Algorithms -- Stochastic Finite Learning -- Sequential Sampling Algorithms: Unified Analysis and Lower Bounds -- Approximate Location of Relevant Variables under the Crossover Distribution.
Record Nr. UNISA-996465302203316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Stochastic Model Checking [[electronic resource] ] : International Autumn School, ROCKS 2012, Vahrn, Italy, October 22-26, 2012. Advanced Lectures / / edited by Anne Remke, Mariëlle Stoelinga
Stochastic Model Checking [[electronic resource] ] : International Autumn School, ROCKS 2012, Vahrn, Italy, October 22-26, 2012. Advanced Lectures / / edited by Anne Remke, Mariëlle Stoelinga
Edizione [1st ed. 2014.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014
Descrizione fisica 1 online resource (XII, 281 p. 69 illus.)
Disciplina 003.76
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science
Software engineering
Compilers (Computer programs)
Computer science—Mathematics
Mathematical statistics
Machine theory
Computer Science Logic and Foundations of Programming
Software Engineering
Compilers and Interpreters
Probability and Statistics in Computer Science
Formal Languages and Automata Theory
ISBN 3-662-45489-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto The tree areas of stochastic models -- Abstraction techniques -- Stochastic model checking.
Record Nr. UNISA-996210509703316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui