2944 search results - page 43 / 589 » Improving Bound Propagation |
CP
2010
Springer
13 years 6 months ago
2010
Springer
The state-of-the-art global constraint for bin packing is due to Shaw. We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow ...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchr...
ICCCN
2008
IEEE
14 years 2 months ago
2008
IEEE
— The current access point (AP) association schemes in wireless LANs, such as IEEE 802.11, cause an unbalanced load which reduces the performance of both the entire network and i...
AAAI
2010
13 years 9 months ago
2010
We present a highly efficient incremental algorithm for propagating bounded knapsack constraints. Our algorithm is based on the sublinear filtering algorithm for binary knapsack c...
IPL
2010
13 years 2 months ago
2010
This paper deals with broadcasting in a network with t-locally bounded Byzantine faults. One of the simplest broadcasting algorithms under Byzantine failures is referred to as a c...