494 search results - page 44 / 99 » Optimal Carpet Cutting |
104
click to vote
POS
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. Aggressive optimization of programs often relies on analysis and transformation that cuts across the natural abstraction boundaries of the source programming language, su...
ECAI
2010
Springer
15 years 29 days ago
2010
Springer
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
RECOMB
2005
Springer
16 years 4 days ago
2005
Springer
We introduce a new scoring method for calculation of alignments of optical maps. Missing cuts, false cuts, and sizing errors present in optical maps are addressed by our alignment...
126
click to vote
ESA
2007
Springer
15 years 6 months ago
2007
Springer
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
WDAG
2001
Springer
15 years 4 months ago
2001
Springer
We generalize the notion of slice introduced in our earlier paper [6]. A slice of a distributed computation with respect to a global predicate is the smallest computation that cont...