Sciweavers

333 search results - page 6 / 67
» Speeding up moving-target search
Sort
View
NIPS
1993
14 years 11 months ago
Using Local Trajectory Optimizers to Speed Up Global Optimization in Dynamic Programming
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
Christopher G. Atkeson
AIA
2006
14 years 11 months ago
Speeding Up Model-based Diagnosis by a Heuristic Approach to Solving SAT
Model-based diagnosis of technical systems requires both a simulation machinery and a logic calculus. The former is responsible for the system's behavior analysis, the latter...
Benno Stein, Oliver Niggemann, Theodor Lettmann
CP
2005
Springer
15 years 3 months ago
Speeding Up Constrained Path Solvers with a Reachability Propagator
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
Luis Quesada, Peter Van Roy, Yves Deville
AAAI
2007
15 years 12 days ago
Concurrent Action Execution with Shared Fluents
Concurrent action execution is important for plan-length minimization. However, action specifications are often limited to avoid conflicts arising from precondition/effect inter...
Michael Buro, Alexander Kovarsky
INTERACT
1997
14 years 11 months ago
Pop-Up Windows and Information Retrieval
Paralinguistics organizers such as parenthesis, footnotes, and pop-up fields on screen, should play an important role signalling the writer’s “minimization” intention when se...
Stéphane Caro