19130 search results - page 294 / 3826 » Modelling multi-path problems |
169
Voted
IJRR
2010
15 years 3 months ago
2010
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
182
click to vote
JAR
2011
15 years 1 months ago
2011
We consider optimization problems of the form (S, cost), where S is a clause set over Boolean variables x1 . . . xn, with an arbitrary cost function cost: Bn → R, and the aim is ...
184
click to vote
JCST
2010
15 years 1 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
155
click to vote
COMPSAC
2007
IEEE
16 years 1 months ago
2007
IEEE
Design patterns encode proven solutions to recurring design problems. To use a design pattern properly, we need to 1) understand the design problem the pattern resolves, 2) recogn...
161
click to vote
FLAIRS
2007
15 years 9 months ago
2007
We deal with the search process of the GraphPlan algorithm in this paper. We concentrate on a problem of finding supports for a sub-goal which arises during the search. We model t...