Sciweavers

2924 search results - page 25 / 585
» Lower Bounds in Distributed Computing
Sort
View
ATAL
2006
Springer
13 years 11 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
EUROPAR
2005
Springer
14 years 1 months ago
Replication Predicates for Dependent-Failure Algorithms
Abstract. To establish lower bounds on the amount of replication, there is a common partition argument used to construct indistinguishable executions such that one violates some pr...
Flavio Paiva Junqueira, Keith Marzullo
ORL
2007
54views more  ORL 2007»
13 years 7 months ago
A new lower bound for the non-oriented two-dimensional bin-packing problem
We propose a new scheme for computing lower bounds for the non-oriented bin-packing problem when the bin is a square. It leads to bounds that theoretically dominate previous resul...
François Clautiaux, Antoine Jouglet, Joseph...
WG
2000
Springer
13 years 11 months ago
New Spectral Lower Bounds on the Bisection Width of Graphs
Sergei L. Bezrukov, Robert Elsässer, Burkhard...