3422 search results - page 381 / 685 » Random Subset Optimization |
132
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
Lossless condensers are unbalanced expander graphs, with expansion close to optimal. Equivalently, they may be viewed as functions that use a short random seed to map a source on ...
143
click to vote
ISPAN
2005
IEEE
15 years 9 months ago
2005
IEEE
We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...
131
click to vote
BIOADIT
2004
Springer
15 years 9 months ago
2004
Springer
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...
124
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
We show that there are unimodal fitness functions and genetic algorithm (GA) parameter settings where the GA, when initialized with a random population, will not move close to the...
125
click to vote
WSC
1998
15 years 5 months ago
1998
Informational Macrodynamics (IMD) presents a unified informational systemic approach with common information language for modeling, analysis and optimization of a variety of inter...