425 search results - page 60 / 85 » Path Coloring on the Mesh |
101
click to vote
DAM
2008
15 years 1 months ago
2008
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
150
Voted
COCOON
2009
Springer
15 years 8 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
141
click to vote
KDD
2004
ACM
15 years 7 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
148
Voted
AROBOTS
2008
15 years 2 months ago
2008
Autonomous mobile robots need to adapt their behavior to the terrain over which they drive, and to predict the traversability of the terrain so that they can effectively plan thei...
111
click to vote
VISUALIZATION
1999
IEEE
15 years 6 months ago
1999
IEEE
View-dependentsimplification has emerged as a powerful tool for graphics acceleration in visualization of complex environments. However, view-dependent simplification techniques h...