38 search results - page 2 / 8 » Easy and Hard Testbeds for Real-Time Search Algorithms |
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
Markerless tracking of human pose is a hard yet relevant problem. In this paper, we derive an efficient filtering algorithm for tracking human pose at 4-10 frames per second using...
LCTRTS
2001
Springer
13 years 9 months ago
2001
Springer
This paper presents an end-to-end synthesis technique for lowpower distributed real-time system design. This technique synthesizes supply voltages of resources to optimize system-...
COCO
2001
Springer
13 years 9 months ago
2001
Springer
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...
GECCO
2010
Springer
13 years 8 months ago
2010
Springer
Originally, genetic algorithms were developed based on the binary representation of candidate solutions in which each conjectured solution is a fixed-length string of binary numb...
GECCO
2009
Springer
13 years 9 months ago
2009
Springer
The restarted line search, or coordinate-wise search, algorithm is tested on the BBOB 2009 testbed. Two different univariate search algorithms (fminbnd from MATLAB and STEP) were...