698 search results - page 79 / 140 » A Deterministic Algorithm for Solving Imprecise Decision Pro... |
111
click to vote
ALGORITHMICA
2002
15 years 3 months ago
2002
We study exploration problems where a robot has to construct a complete map of an unknown environment using a path that is as short as possible. In the rst problem setting we cons...
192
click to vote
DAC
2005
ACM
16 years 4 months ago
2005
ACM
Pointer analysis, a classic problem in software program analysis, has emerged as an important problem to solve in design automation, at a time when complex designs, specified in t...
133
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We consider model-based reinforcement learning in finite Markov Decision Processes (MDPs), focussing on so-called optimistic strategies. Optimism is usually implemented by carryin...
123
click to vote
ICIP
2008
IEEE
16 years 5 months ago
2008
IEEE
In this paper we address two closely related problems. The first is the object detection problem, i.e., the automatic decision of whether a given image represents a known object o...
115
click to vote
AAAI
2007
15 years 5 months ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...