Sciweavers

1813 search results - page 325 / 363
» Instance Pruning Techniques
Sort
View
GECCO
2008
Springer
238views Optimization» more  GECCO 2008»
14 years 10 months ago
Using multiple offspring sampling to guide genetic algorithms to solve permutation problems
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
Antonio LaTorre, José Manuel Peña, V...
CPHYSICS
2006
204views more  CPHYSICS 2006»
14 years 9 months ago
Genetically controlled random search: a global optimization method for continuous multidimensional functions
A new stochastic method for locating the global minimum of a multidimensional function inside a rectangular hyperbox is presented. A sampling technique is employed that makes use ...
Ioannis G. Tsoulos, Isaac E. Lagaris
KER
2008
193views more  KER 2008»
14 years 9 months ago
The 1st international workshop on computational social choice
Computational social choice is a new discipline currently emerging at the interface of social choice theory and computer science. It is concerned with the application of computati...
Ulle Endriss
NETWORK
2008
119views more  NETWORK 2008»
14 years 9 months ago
Improving the Performance of Route Control Middleboxes in a Competitive Environment
Multihomed subscribers are increasingly adopting intelligent route control solutions to optimize the cost and end-to-end performance of the traffic routed among the different link...
Marcelo Yannuzzi, Xavier Masip-Bruin, Eva Mar&iacu...
74
Voted
AI
2005
Springer
14 years 9 months ago
The distributed breakout algorithms
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
Katsutoshi Hirayama, Makoto Yokoo