12950 search results - page 333 / 2590 » On Optimal Timed Strategies |
171
click to vote
COMPGEOM
1994
ACM
15 years 11 months ago
1994
ACM
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
176
click to vote
AAAI
2007
15 years 9 months ago
2007
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
186
click to vote
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
In order for recognition systems to scale to a larger number of object categories building visual class taxonomies is important to achieve running times logarithmic in the number o...
197
click to vote
PAAPP
2002
15 years 6 months ago
2002
Abstract. The performance of shared-memory (OpenMP) implementations of three different PDE solver kernels representing finite difference methods, finite volume methods, and spectra...
199
click to vote
FOCI
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract-- In this paper, we empirically analyze the convergence behavior of evolutionary algorithms (evolution strategies