1041 search results - page 92 / 209 » Randomizing Reductions of Search Problems |
IWANN
2009
Springer
14 years 2 months ago
2009
Springer
Generating test data for formal state based specifications is computationally expensive. This paper improves a framework that addresses this issue by representing the test data ge...
AUSAI
2008
Springer
13 years 10 months ago
2008
Springer
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
We address the problem of image search on a very large scale, where three constraints have to be considered jointly: the accuracy of the search, its efficiency, and the memory usag...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
This study examines the utility of grammatical ephemeral random constants, and conducts an analysis of the preferences of evolutionary search when a number of different grammar ba...
EUROCAST
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this work we consider the application of metaheuristic algorithms to the problem of fitting rectangular signals to time-data series. The application background is to ...