3471 search results - page 219 / 695 » Obstacle Numbers of Graphs |
160
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
Legged robots are useful in tasks such as search and rescue because they can effectively navigate on rugged terrain. However, it is difficult to design controllers for them that ...
139
click to vote
SWARM
2008
SPRINGER
15 years 5 months ago
2008
SPRINGER
In this paper, we study self-organized flocking in a swarm of mobile robots. We present Kobot, a mobile robot platform developed specifically for swarm robotic studies. We describe...
175
click to vote
SIGMETRICS
2000
ACM
15 years 4 months ago
2000
ACM
Hot spots are a major obstacle to achieving scalability in the Internet. At the application layer, hot spots are usually caused by either (a) high demand for some data or (b) high...
144
Voted
CORR
2008
Springer
15 years 5 months ago
2008
Springer
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...
150
click to vote
CVPR
2006
IEEE
16 years 7 months ago
2006
IEEE
This paper presents a new volumetric stereo algorithm to reconstruct the 3D shape of an arbitrary object. Our method is based on finding the minimum cut in an octahedral graph str...