192 search results - page 15 / 39 » On-Demand Bound Computation for Best-First Constraint Optimi... |
NETWORKING
2010
14 years 11 months ago
2010
The construction of light-trees is one principal subproblem for multicast routing in sparse splitting Wavelength Division Multiplexing (WDM) networks. Due to the light splitting co...
79
Voted
ICALP
2009
Springer
15 years 4 months ago
2009
Springer
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dualobjective scheduling problems, where the operating...
74
Voted
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
FSTTCS
2009
Springer
15 years 2 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
IS
2008
14 years 9 months ago
2008
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...