Sciweavers

113 search results - page 20 / 23
» Symmetry Breaking
Sort
View
CPAIOR
2008
Springer
14 years 11 months ago
Optimal Deployment of Eventually-Serializable Data Services
Abstract. Replication is a fundamental technique for increasing throughput and achieving fault tolerance in distributed data services. However, its implementation may induce signif...
Laurent Michel, Alexander A. Shvartsman, Elaine L....
CORR
2008
Springer
149views Education» more  CORR 2008»
14 years 9 months ago
Phase Transitions on Fixed Connected Graphs and Random Graphs in the Presence of Noise
In this paper, we study phase transition behavior emerging from the interactions among multiple agents in the presence of noise. We propose a simple discrete-time model in which a...
Jialing Liu, Vikas Yadav, Hullas Sehgal, Joshua M....
96
Voted
DC
2010
14 years 9 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer
JUCS
2007
118views more  JUCS 2007»
14 years 9 months ago
Satisfying Assignments of Random Boolean Constraint Satisfaction Problems: Clusters and Overlaps
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
Gabriel Istrate
101
Voted
CPAIOR
2010
Springer
14 years 8 months ago
Boosting Set Constraint Propagation for Network Design
Abstract. This paper reconsiders the deployment of synchronous optical networks (SONET), an optimization problem naturally expressed in terms of set variables. Earlier approaches, ...
Justin Yip, Pascal Van Hentenryck, Carmen Gervet