Sciweavers

4377 search results - page 343 / 876
» Mass problems and randomness
Sort
View
BIOADIT
2004
Springer
16 years 6 days ago
Searching for a Practical Evidence of the No Free Lunch Theorems
Abstract. According to the No Free Lunch (NFL) theorems all blackbox algorithms perform equally well when compared over the entire set of optimization problems. An important proble...
Mihai Oltean
GECCO
2006
Springer
220views Optimization» more  GECCO 2006»
15 years 10 months ago
A comparative study of immune system based genetic algorithms in dynamic environments
Diversity and memory are two major mechanisms used in biology to keep the adaptability of organisms in the everchanging environment in nature. These mechanisms can be integrated i...
Shengxiang Yang
COMPGEOM
2008
ACM
15 years 8 months ago
Embedding and similarity search for point sets under translation
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
Minkyoung Cho, David M. Mount
CPAIOR
2008
Springer
15 years 8 months ago
Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
Tino Teige, Martin Fränzle
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
15 years 8 months ago
IMproved results for route planning in stochastic transportation
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
Justin A. Boyan, Michael Mitzenmacher