2924 search results - page 265 / 585 » Lower Bounds in Distributed Computing |
141
click to vote
JGAA
2006
15 years 4 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
134
click to vote
IPPS
2005
IEEE
15 years 9 months ago
2005
IEEE
Traditional techniques for building dependable, highperformance distributed systems are too expensive for most non-critical systems, often causing dependability to be sidelined as...
130
click to vote
STOC
2006
ACM
15 years 10 months ago
2006
ACM
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
142
click to vote
RECOMB
2008
Springer
16 years 4 months ago
2008
Springer
Since the discovery of the "Philadelphia chromosome" in chronic myelogenous leukemia in 1960, there is an ongoing intensive research of chromosomal aberrations in cancer....
124
click to vote
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
We consider the standard model of finite two-person zero-sum stochastic games with signals. We are interested in the existence of almost-surely winning or positively winning stra...