1132 search results - page 42 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
125
click to vote
JMLR
2010
14 years 8 months ago
2010
Bandit algorithms are concerned with trading exploration with exploitation where a number of options are available but we can only learn their quality by experimenting with them. ...
101
click to vote
GLOBECOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— We consider a ring topology with limited or full switching capability as deployed in high bandwidth metro optical networks and develop a model to estimate the probability of bl...
121
click to vote
JPDC
2006
2006
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
15 years 1 months ago
In distributed shared memory multiprocessors, remote memory references generate processor-to-memory traffic, which may result in a bottleneck. It is therefore important to design ...
131
click to vote
SWAT
2010
Springer
15 years 7 months ago
2010
Springer
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
110
click to vote
ECCC
2010
14 years 11 months ago
2010
We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the -two-sided-error rando...