2924 search results - page 198 / 585 » Lower Bounds in Distributed Computing |
104
Voted
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
Work stealing is a popular method of scheduling fine-grained parallel tasks. The performance of work stealing has been extensively studied, both theoretically and empirically, but...
158
click to vote
UAI
2008
15 years 4 months ago
2008
Confidence measures for the generalization error are crucial when small training samples are used to construct classifiers. A common approach is to estimate the generalization err...
135
click to vote
MFCS
2010
Springer
15 years 1 months ago
2010
Springer
We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observationbased strategy relies on partial information...
126
click to vote
JGO
2010
14 years 10 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
110
click to vote
CHI
2010
ACM
15 years 7 months ago
2010
ACM
We introduce a programming environment entitled Share that is designed to encourage loosely bound cooperation between individuals within communities of practice through the sharin...