216 search results - page 20 / 44 » The Complexity of Planning Problems With Simple Causal Graph... |
SOFSEM
2010
Springer
14 years 2 months ago
2010
Springer
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...
GD
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents a new framework for drawing graphs in three dimensions. In general, the new framework uses a divide and conquer approach. More specifically, the framework divi...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— Recent research trends and technology developments are bringing us closer to the realization of autonomous multirobot systems performing increasingly complex missions. ...
JPDC
2007
13 years 7 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
HICSS
2003
IEEE
14 years 1 months ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...