Sciweavers

2814 search results - page 295 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
87
Voted
SDM
2007
SIAM
104views Data Mining» more  SDM 2007»
15 years 1 months ago
Boosting Optimal Logical Patterns Using Noisy Data
We consider the supervised learning of a binary classifier from noisy observations. We use smooth boosting to linearly combine abstaining hypotheses, each of which maps a subcube...
Noam Goldberg, Chung-chieh Shan
128
Voted
SAT
2010
Springer
172views Hardware» more  SAT 2010»
14 years 11 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
WDAG
1990
Springer
72views Algorithms» more  WDAG 1990»
15 years 4 months ago
Common Knowledge and Consistent Simultaneous Coordination
Traditional problems in distributed systems include the Reliable Broadcast, Distributed Consensus, and Distributed Firing Squad problems. These problems require coordination only ...
Gil Neiger, Mark R. Tuttle
PODC
2005
ACM
15 years 6 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
93
Voted
IPPS
1998
IEEE
15 years 4 months ago
A Generalized Framework for Global Communication Optimization
In distributed-memory message-passing architectures reducing communication cost is extremely important. In this paper, we present a technique to optimize communication globally. O...
Mahmut T. Kandemir, Prithviraj Banerjee, Alok N. C...