2698 search results - page 330 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
164
click to vote
AAMAS
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. We study optimal control in large stochastic multi-agent systems in continuous space and time. We consider multi-agent systems where agents have independent dynamics with...
166
click to vote
CCCG
1994
15 years 7 months ago
1994
We formulate the problem of computing the widest empty corridor with at most ` links and right-angle turns for a set of n points. It is a generalization of the widest empty corrid...
179
click to vote
DAM
2008
15 years 6 months ago
2008
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
161
click to vote
AI
1999
Springer
15 years 6 months ago
1999
Springer
There are many different approaches to solving planning problems, one of which is the use of domain specific control knowledge to help guide a domain independent search algorithm. ...
191
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Graph data are subject to uncertainties in many applications due to incompleteness and imprecision of data. Mining uncertain graph data is semantically different from and computat...