1650 search results - page 226 / 330 » The HOM problem is decidable |
146
click to vote
BTW
2009
Springer
16 years 28 days ago
2009
Springer
: Users of front office applications such as call center or customer support applications make millions and millions of decisions each day without analytical support. For example, ...
158
click to vote
ISAAC
2009
Springer
16 years 27 days ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
138
click to vote
SSS
2009
Springer
16 years 27 days ago
2009
Springer
: The Borowsky-Gafni (BG) simulation algorithm is a powerful tool that allows a set of t + 1 asynchronous sequential processes to wait-free simulate (i.e., despite the crash of up ...
140
click to vote
IPPS
2008
IEEE
16 years 23 days ago
2008
IEEE
We propose a novel framework for multi-source video streaming in peer-to-peer (P2P) networks. Multiple videos are distributed to all requesting peers exploiting full collaboration...
169
click to vote
LICS
2008
IEEE
16 years 22 days ago
2008
IEEE
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...