256 search results - page 30 / 52 » A Unified Approach to Approximating Partial Covering Problem... |
ICRA
2008
IEEE
14 years 2 months ago
2008
IEEE
— This paper proposes a new way to achieve robotic tasks by visual servoing. Instead of using geometric features (points, straight lines, pose, homography, etc.) as it is usually...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Decentralized partially observable Markov decision processes (DEC-POMDPs) form a general framework for planning for groups of cooperating agents that inhabit a stochastic and part...
ACST
2006
13 years 9 months ago
2006
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
AIPS
2011
12 years 11 months ago
2011
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...
EDBT
2009
ACM
14 years 2 months ago
2009
ACM
Keyword search has been recently extended to relational databases to retrieve information from text-rich attributes. However, all the existing methods focus on finding individual...