707 search results - page 107 / 142 » Solving path problems on the GPU |
DAGSTUHL
2007
15 years 1 months ago
2007
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...
106
click to vote
TMC
2008
14 years 11 months ago
2008
In this paper, we propose a bandwidth-efficient multicast mechanism for heterogeneous wireless networks. We reduce the bandwidth cost of an Internet Protocol (IP) multicast tree by...
101
click to vote
TCAD
2002
14 years 11 months ago
2002
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuits...
ICRA
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— We present the Constrained Bi-directional RapidlyExploring Random Tree (CBiRRT) algorithm for planning paths in configuration spaces with multiple constraints. This al...
103
click to vote
EEMMAS
2007
Springer
15 years 6 months ago
2007
Springer
In this talk I present recent research in swarm robotics, the discipline that studies robotic systems composed of swarms of robots tightly interacting and cooperating to reach thei...