66 search results - page 8 / 14 » Using Caching to Solve Larger Probabilistic Planning Problem... |
107
click to vote
CVPR
2010
IEEE
14 years 11 months ago
2010
IEEE
Most tracking algorithms implicitly apply a coarse segmentation of each target object using a simple mask such as a rectangle or an ellipse. Although convenient, such coarse segme...
ASPDAC
2005
ACM
15 years 1 months ago
2005
ACM
Abstract— This paper presents a post-route gate-sizing algorithm for coupling-noise reduction that constrains the yield loss under process variations. Algorithms for coupling-noi...
108
click to vote
JAIR
2011
14 years 6 months ago
2011
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
102
click to vote
ICRA
2008
IEEE
15 years 6 months ago
2008
IEEE
— An important problem in position-based visual servoing (PBVS) is to guarantee that a target will remain within the field of view for the duration of the task. In this paper, w...
98
Voted
TACAS
2010
Springer
15 years 6 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...