13603 search results - page 2362 / 2721 » On the Complexity of Computing Treelength |
174
Voted
AAAI
2007
15 years 9 months ago
2007
We consider problems of geometric exploration and selfdeployment for simple robots that can only sense the combinatorial (non-metric) features of their surroundings. Even with suc...
173
Voted
AAAI
2007
15 years 9 months ago
2007
Planning under uncertainty involves two distinct sources of uncertainty: uncertainty about the effects of actions and uncertainty about the current state of the world. The most wi...
187
click to vote
AIPS
2007
15 years 9 months ago
2007
We consider the problem of finding an n-agent jointpolicy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity ...
183
click to vote
AIPS
2008
15 years 9 months ago
2008
The POMDP is considered as a powerful model for planning under uncertainty. However, it is usually impractical to employ a POMDP with exact parameters to model precisely the real-...
170
Voted
DLOG
2007
15 years 9 months ago
2007
Abstract. The Chemical Formulation Problem (Compounding Problem) consists in modifying the chemical formulation of a compound in order to obtain a new compound showing a set of des...