Sciweavers

2924 search results - page 94 / 585
» Lower Bounds in Distributed Computing
Sort
View
FOCS
2002
IEEE
15 years 5 months ago
Testing Juntas
We consider the problem of testing functions for the property of being a k-junta (i.e., of depending on at most k variables). Fischer, Kindler, Ron, Safra, and Samorodnitsky (J. Co...
Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra...
HIPC
2007
Springer
15 years 6 months ago
Grid'BnB : A Parallel Branch and Bound Framework for Grids
Denis Caromel, Alexandre di Costanzo, Laurent Badu...
92
Voted
PODC
2006
ACM
15 years 6 months ago
Reliable broadcast in radio networks: the bounded collision case
Chiu-Yuen Koo, Vartika Bhandari, Jonathan Katz, Ni...
AI
1999
Springer
15 years 8 days ago
Coalition Structure Generation with Worst Case Guarantees
Coalition formation is a key topic in multiagent systems. One may prefer a coalition structure that maximizes the sum of the values of the coalitions, but often the number of coal...
Tuomas Sandholm, Kate Larson, Martin Andersson, On...
118
Voted
AAAI
1996
15 years 1 months ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
Richard J. Wallace