6251 search results - page 1136 / 1251 » Randomness, Computability, and Density |
DSN
2008
IEEE
14 years 4 months ago
2008
IEEE
Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their int...
ICDCS
2007
IEEE
14 years 4 months ago
2007
IEEE
State-of-the-art networked storage servers are equipped with increasingly powerful computing capability and large DRAM memory as storage caches. However, their contribution to the...
QEST
2007
IEEE
14 years 4 months ago
2007
IEEE
We investigate logics and equivalence relations that capture the qualitative behavior of Markov Decision Processes (MDPs). We present Qualitative Randomized Ctl (Qrctl): formulas o...
FOCS
2006
IEEE
14 years 4 months ago
2006
IEEE
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
FOCS
2006
IEEE
14 years 4 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...