254 search results - page 6 / 51 » Deterministic Soliton Graphs |
VALUETOOLS
2006
ACM
15 years 3 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
CORR
2010
Springer
14 years 4 months ago
2010
Springer
We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known dete...
DCOSS
2008
Springer
14 years 11 months ago
2008
Springer
This paper studies the problem of associating deterministically a track revealed by a binary sensor network with the trajectory of a unique moving anonymous object, namely the Mult...
SIAMCOMP
2000
14 years 9 months ago
2000
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with m polynomial in n, where each mesh node hosts a processor and a memory module. A...
SODA
1993
ACM
14 years 10 months ago
1993
ACM
The following bounds on the competitive ratios of deterministic and randomized on-line algorithms for traversing width-w layered graphs are obtained.