3471 search results - page 573 / 695 » Obstacle Numbers of Graphs |
150
click to vote
CPAIOR
2008
Springer
15 years 6 months ago
2008
Springer
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
144
Voted
SIROCCO
2008
15 years 6 months ago
2008
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
170
click to vote
OPODIS
2004
15 years 6 months ago
2004
S (in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps : Speaker: Anish Arora (Ohio State) Title: Self-Stabilizi...
177
click to vote
NIPS
2001
15 years 6 months ago
2001
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
128
click to vote
CONCUR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...