16404 search results - page 547 / 3281 » A set coverage problem |
178
click to vote
STACS
2001
Springer
15 years 11 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
177
click to vote
EPIA
1995
Springer
15 years 10 months ago
1995
Springer
In this paper, we study the retrieval problem in ALN, which is a tractable concept language with number restrictions. Following the approach proposed in [12], this work differs fr...
164
click to vote
AAAI
2008
15 years 9 months ago
2008
This paper addresses the problem of plan recognition for multi-agent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. ...
169
click to vote
AIPS
2008
15 years 9 months ago
2008
We present a planner for the Combat Power Management (CPM) problem. In response to multiple simultaneous or sequential threats, the planner generates a set of local plans, one for...
179
click to vote
NIPS
2007
15 years 8 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...