2899 search results - page 74 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
128
click to vote
HPCC
2007
Springer
15 years 7 months ago
2007
Springer
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
We propose a crossover method to combine complexly overlapping building blocks (BBs). Although there have been several techniques to identify linkage sets of loci o form a BB [4, ...
108
click to vote
ALGOSENSORS
2009
Springer
15 years 8 months ago
2009
Springer
Sensor networks, with their ad hoc deployments, node mobility, and wireless communication, pose serious challenges for developing provably correct and efficient applications. A po...
128
click to vote
STACS
2001
Springer
15 years 5 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...