Sciweavers

4372 search results - page 112 / 875
» Algorithmic Theories of Everything
Sort
View
92
Voted
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
15 years 6 months ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste
102
Voted
GCC
2003
Springer
15 years 6 months ago
A Load Balancing Algorithm for Web Based Server Grids
Load balance is a critical issue in distributed systems, such as server grids. In this paper, we propose a Balanced Load Queue (BLQ) model, which combines the queuing theory and hy...
Shui Yu, John Casey, Wanlei Zhou
103
Voted
SAGT
2010
Springer
175views Game Theory» more  SAGT 2010»
14 years 11 months ago
On Learning Algorithms for Nash Equilibria
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
Constantinos Daskalakis, Rafael Frongillo, Christo...
ALGORITHMICA
2006
77views more  ALGORITHMICA 2006»
15 years 27 days ago
Scalable Parallel Algorithms for FPT Problems
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
92
Voted
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
15 years 7 months ago
Finding critical backbone structures with genetic algorithms
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
Adam Prügel-Bennett