4926 search results - page 275 / 986 » Two Graph Algorithms On an Associative Computing Model |
147
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...
188
click to vote
TON
2010
15 years 25 days ago
2010
Abstract--This paper develops novel mechanisms for recovering from failures in IP networks with proactive backup path calculations and IP tunneling. The primary scheme provides res...
212
Voted
SPRINGSIM
2010
15 years 4 months ago
2010
Concise and reliable graph-theoretic analysis of complex networks today is a cumbersome task, consisting essentially of the adaptation of intricate libraries for each specific pr...
150
Voted
ESOP
1990
Springer
15 years 10 months ago
1990
Springer
The need to integrate several versions of a program into a common one arises frequently, but it is a tedious and time consuming task to merge programs by hand. The program-integrat...
159
click to vote
STOC
1992
ACM
15 years 10 months ago
1992
ACM
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...