940 search results - page 37 / 188 » Control Abstractions for Local Search |
121
click to vote
IROS
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract— Many planning approaches adhere to the twotiered architecture consisting of a long-range, low fidelity global planner and a short-range high fidelity local planner. W...
131
click to vote
ICIAP
2005
ACM
16 years 2 months ago
2005
ACM
Abstract. We present a technique that achieves local contrast enhancement by representing it as an optimization problem. For this, we first introduce a scalar objective function th...
112
click to vote
HYBRID
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. In this paper we propose a trajectory based reachability analysis by using local finite-time invariance property. Trajectory based analysis are based on the execution tra...
122
click to vote
DEXA
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
131
click to vote
JCO
1998
15 years 1 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...