Sciweavers

333 search results - page 3 / 67
» Speeding up moving-target search
Sort
View
EOR
2010
116views more  EOR 2010»
13 years 6 months ago
Speeding up continuous GRASP
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
Michael J. Hirsch, Panos M. Pardalos, Mauricio G. ...
IJCAI
2003
13 years 7 months ago
Propagate the Right Thing: How Preferences Can Speed-Up Constraint Solving
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...
Christian Bessière, Anaïs Fabre, Ulric...
CVPR
2006
IEEE
14 years 8 months ago
An Integrated Model of Top-Down and Bottom-Up Attention for Optimizing Detection Speed
Integration of goal-driven, top-down attention and image-driven, bottom-up attention is crucial for visual search. Yet, previous research has mostly focused on models that are pur...
Vidhya Navalpakkam, Laurent Itti
AAAI
2010
13 years 7 months ago
To Max or Not to Max: Online Learning for Speeding Up Optimal Planning
It is well known that there cannot be a single "best" heuristic for optimal planning in general. One way of overcoming this is by combining admissible heuristics (e.g. b...
Carmel Domshlak, Erez Karpas, Shaul Markovitch
CORR
2007
Springer
89views Education» more  CORR 2007»
13 years 6 months ago
Speeding up Simplification of Polygonal Curves using Nested Approximations
: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used betwe...
Pierre-Francois Marteau, Gildas Ménier