48 search results - page 3 / 10 » Experimental Supplements to the Theoretical Analysis of EAs ... |
SYNTHESE
2008
2008
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
13 years 5 months ago
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...
SAGA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Motivated by an application in project portfolio analysis under uncertainty, we develop an algorithm S-VNS for solving stochastic combinatorial optimization (SCO) problem...
CEC
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...
ICRA
2010
IEEE
13 years 3 months ago
2010
IEEE
— Game theoretical approaches have been recently used to develop patrolling strategies for mobile robots. The idea is that the patroller and the intruder play a game, whose outco...
COR
2008
13 years 5 months ago
2008
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...