2944 search results - page 31 / 589 » Improving Bound Propagation |
115
click to vote
COCOON
2006
Springer
15 years 3 months ago
2006
Springer
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...
DAC
2006
ACM
15 years 5 months ago
2006
ACM
In this paper, we propose a novel technique on mining relationships in a sequential circuit to discover global constraints. In contrast to the traditional learning methods, our mi...
ALGORITHMICA
2010
14 years 12 months ago
2010
We consider a novel class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key within ...
DM
2008
14 years 12 months ago
2008
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing o...
100
click to vote
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...