14 search results - page 3 / 3 » Lower Bounds for Online Bin Stretching with Several Bins |
TCS
2008
13 years 4 months ago
2008
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...
MFCS
2005
Springer
13 years 10 months ago
2005
Springer
We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider open-end coloring, cardin...
BCB
2010
12 years 12 months ago
2010
As a metabolic network reaches from a state to a steady state, a subset of its fluxes gradually change. The sequence of intermediate states, called the dynamic state, shows the pa...
SIGMOD
2008
ACM
14 years 5 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...