7228 search results - page 338 / 1446 » From Algorithmic to Subjective Randomness |
147
Voted
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
134
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
In order to solve nonstationary optimization problems efficiently, evolutionary algorithms need sufficient diversity to adapt to environmental changes. The dual-population genetic...
134
click to vote
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
One approach in verifying the correctness of a multiprocessor system is to show that its execution results comply with the memory consistency model it is meant to implement. It ha...
153
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...
147
click to vote
ATAL
2008
Springer
15 years 7 months ago
2008
Springer
Due to computational intractability, large scale coordination algorithms are necessarily heuristic and hence require tuning for particular environments. In domains where character...