Sciweavers

13414 search results - page 296 / 2683
» The distributed boosting algorithm
Sort
View
PODC
2010
ACM
15 years 8 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
FLAIRS
2003
15 years 8 months ago
BUC Algorithm for Iceberg Cubes: Implementation and Sensitivity Analysis
The Iceberg-Cube problem restricts the computation of the data cube to only those group-by partitions satisfying a minimum threshold condition defined on a specified measure. In t...
George E. Nasr, Celine Badr
DEBS
2003
ACM
15 years 12 months ago
Introducing reliability in content-based publish-subscribe through epidemic algorithms
Distributed content-based publish-subscribe middleware provides the necessary decoupling, flexibility, expressiveness, and scalability required by modern distributed applications...
Paolo Costa, Matteo Migliavacca, Gian Pietro Picco...
GECCO
2008
Springer
152views Optimization» more  GECCO 2008»
15 years 7 months ago
Designing EDAs by using the elitist convergent EDA concept and the boltzmann distribution
This paper presents a theoretical definition for designing EDAs called Elitist Convergent Estimation of Distribution Algorithm (ECEDA), and a practical implementation: the Boltzm...
Sergio Ivvan Valdez Peña, Arturo Hern&aacut...
CSCLP
2004
Springer
16 years 2 days ago
Dynamic Distributed BackJumping
We consider Distributed Constraint Satisfaction Problems (DisCSP) when control of variables and constraints is distributed among a set of agents. This paper presents a distributed ...
Viet Nguyen, Djamila Sam-Haroud, Boi Faltings