1612 search results - page 202 / 323 » Analysing Randomized Distributed Algorithms |
120
click to vote
MIDDLEWARE
2005
Springer
15 years 8 months ago
2005
Springer
Unstructured peer-to-peer networks are frequently used as the overlay in various middleware toolkits for emerging applications, from content discovery to query result caching to di...
133
click to vote
COLT
1992
Springer
15 years 6 months ago
1992
Springer
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
114
Voted
PODC
2010
ACM
15 years 6 months ago
2010
ACM
We define two new classes of shared-memory objects: ratifiers, which detect agreement, and conciliators, which ensure agreement with some probability. We show that consensus can...
131
Voted
IJCAI
2001
15 years 3 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
94
Voted
COR
2007
15 years 2 months ago
2007
An NP-hard production–distribution problem for one product over a multi-period horizon is investigated. The aim is to minimize total cost taking production setups, inventory lev...