Stochastic Algorithms: Foundations and Applications - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540294986, 9783540322450

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On the Properties of Asymptotic Probability for Random Boolean Expression Values in Binary Bases

Stochastic Algorithms: Foundations and Applications - Lecture Notes in Computer Science ◽

10.1007/11571155_17 ◽

2005 ◽

pp. 202-212 ◽

Cited By ~ 1

Author(s):

Alexey D. Yashunsky

Keyword(s):

Boolean Expression ◽

Asymptotic Probability

Download Full-text

On Some Bounds on the Size of Branching Programs (A Survey)

Stochastic Algorithms: Foundations and Applications - Lecture Notes in Computer Science ◽

10.1007/11571155_11 ◽

2005 ◽

pp. 107-115

Author(s):

Elizaveta A. Okol’nishnikova

Keyword(s):

Branching Programs

Download Full-text

New Computation Paradigm for Modular Exponentiation Using a Graph Model

Stochastic Algorithms: Foundations and Applications - Lecture Notes in Computer Science ◽

10.1007/11571155_14 ◽

2005 ◽

pp. 170-179

Author(s):

Chi Seong Park ◽

Mun-Kyu Lee ◽

Dong Kyue Kim

Keyword(s):

Graph Model ◽

Modular Exponentiation

Download Full-text

On Improved Least Flexibility First Heuristics Superior for Packing and Stock Cutting Problems

Stochastic Algorithms: Foundations and Applications - Lecture Notes in Computer Science ◽

10.1007/11571155_8 ◽

2005 ◽

pp. 70-81 ◽

Cited By ~ 3

Author(s):

Yu-Liang Wu ◽

Chi-Kong Chan

Keyword(s):

Stock Cutting ◽

Cutting Problems

Download Full-text

Solving a Dynamic Cell Formation Problem with Machine Cost and Alternative Process Plan by Memetic Algorithms

Stochastic Algorithms: Foundations and Applications - Lecture Notes in Computer Science ◽

10.1007/11571155_18 ◽

2005 ◽

pp. 213-227 ◽

Cited By ~ 15

Author(s):

Reza Tavakkoli-Moghaddam ◽

Nima Safaei ◽

Masoud Babakhani

Keyword(s):

Cell Formation ◽

Memetic Algorithms ◽

Cell Formation Problem ◽

Process Plan ◽

Alternative Process ◽

Formation Problem ◽

Dynamic Cell ◽

Machine Cost

Download Full-text

Some Heuristic Analysis of Local Search Algorithms for SAT Problems

Stochastic Algorithms: Foundations and Applications - Lecture Notes in Computer Science ◽

10.1007/11571155_2 ◽

2005 ◽

pp. 14-25

Author(s):

Osamu Watanabe

Keyword(s):

Local Search ◽

Search Algorithms ◽

Local Search Algorithms ◽

Heuristic Analysis

Download Full-text

Dynamic Facility Location with Stochastic Demands

Stochastic Algorithms: Foundations and Applications - Lecture Notes in Computer Science ◽

10.1007/11571155_15 ◽

2005 ◽

pp. 180-189 ◽

Cited By ~ 7

Author(s):

Martin Romauch ◽

Richard F. Hartl

Keyword(s):

Facility Location ◽

Stochastic Demands

Download Full-text

The Complexity of Classical and Quantum Branching Programs: A Communication Complexity Approach

Stochastic Algorithms: Foundations and Applications - Lecture Notes in Computer Science ◽

10.1007/11571155_16 ◽

2005 ◽

pp. 190-201

Author(s):

Farid Ablayev

Keyword(s):

Communication Complexity ◽

Branching Programs

Download Full-text

Clustering in Stochastic Asynchronous Algorithms for Distributed Simulations

Stochastic Algorithms: Foundations and Applications - Lecture Notes in Computer Science ◽

10.1007/11571155_3 ◽

2005 ◽

pp. 26-37 ◽

Cited By ~ 6

Author(s):

Anatoli Manita ◽

François Simonot

Keyword(s):

Asynchronous Algorithms ◽

Distributed Simulations

Download Full-text

Self-replication, Evolvability and Asynchronicity in Stochastic Worlds

Stochastic Algorithms: Foundations and Applications - Lecture Notes in Computer Science ◽

10.1007/11571155_13 ◽

2005 ◽

pp. 126-169 ◽

Cited By ~ 3

Author(s):

Chrystopher L. Nehaniv

Keyword(s):

Self Replication

Download Full-text

Stochastic Algorithms: Foundations and Applications - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

On the Properties of Asymptotic Probability for Random Boolean Expression Values in Binary Bases

On Some Bounds on the Size of Branching Programs (A Survey)

New Computation Paradigm for Modular Exponentiation Using a Graph Model

On Improved Least Flexibility First Heuristics Superior for Packing and Stock Cutting Problems

Solving a Dynamic Cell Formation Problem with Machine Cost and Alternative Process Plan by Memetic Algorithms

Some Heuristic Analysis of Local Search Algorithms for SAT Problems

Dynamic Facility Location with Stochastic Demands

The Complexity of Classical and Quantum Branching Programs: A Communication Complexity Approach

Clustering in Stochastic Asynchronous Algorithms for Distributed Simulations

Self-replication, Evolvability and Asynchronicity in Stochastic Worlds

Stochastic Algorithms: Foundations and Applications - Lecture Notes in Computer Science
Latest Publications