Sciweavers

1310 search results - page 198 / 262
» A parallel genetic algorithm to solve the set-covering probl...
Sort
View
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 2 months ago
Evolving virtual creatures revisited
Thirteen years have passed since Karl Sims published his work on evolving virtual creatures. Since then, several novel approaches to neural network evolution and genetic algorithm...
Peter Krcah
FOCS
2008
IEEE
14 years 3 months ago
The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well)
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. ...
Michael Ben-Or, Avinatan Hassidim
GECCO
2007
Springer
184views Optimization» more  GECCO 2007»
14 years 2 months ago
ECGA vs. BOA in discovering stock market trading experts
This paper presents two evolutionary algorithms, ECGA and BOA, applied to constructing stock market trading expertise, which is built on the basis of a set of specific trading ru...
Piotr Lipinski
ISPAN
2005
IEEE
14 years 2 months ago
Minimum Cost Paths Subject to Minimum Vulnerability for Reliable Communications
Abstract—In real networks, disjoint paths are needed for providing protection against single link/node failure. When disjoint paths cannot be found, an alternative solution is to...
Bing Yang, Mei Yang, Jianping Wang, S. Q. Zheng
IPPS
1999
IEEE
14 years 1 months ago
A Performance Model of Speculative Prefetching in Distributed Information Systems
Previous studies in speculative prefetching focus on building and evaluating access models for the purpose of access prediction. This paper investigates a complementary area which...
Nor Jaidi Tuah, Mohan Kumar, Svetha Venkatesh