122 search results - page 4 / 25 » Using Disjoint Reachability for Parallelization |
ICPADS
2007
IEEE
14 years 1 months ago
2007
IEEE
Security is a common problem in completely decentralized peer-to-peer systems. Although several suggestions exist on how to create a secure key-based routing protocol, a practicab...
SPAA
2003
ACM
14 years 19 days ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
For hypercube networks which have faulty nodes, a few ecient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two im...
CONCUR
2000
Springer
13 years 11 months ago
2000
Springer
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
SPAA
2005
ACM
14 years 29 days ago
2005
ACM
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (...