2924 search results - page 259 / 585 » Lower Bounds in Distributed Computing |
124
Voted
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
Clustering and scheduling of tasks for parallel implementation is a well researched problem. Several techniques have been presented in the literature to improve performance and re...
169
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Many low-level vision algorithms assume a prior probability over images, and there has been great interest in trying to learn this prior from examples. Since images are very non G...
136
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
130
Voted
FOCS
2010
IEEE
15 years 2 months ago
2010
IEEE
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
147
click to vote
CONCUR
2001
Springer
15 years 8 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...