122 search results - page 1 / 25 » A Short Cut to Optimal Sequences |
APLAS
2009
ACM
13 years 11 months ago
2009
ACM
We propose a method for easily developing efficient programs for finding optimal sequences, such as the maximum weighted sequence of a set of feasible ones. We formalize a way to ...
DAC
2001
ACM
14 years 5 months ago
2001
ACM
Recursive partitioning based placement has a long history, but there has been little consensus on how cut sequences should be chosen. In this paper, we present a dynamic programmi...
SAIG
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Short cut fusion is a particular program transformation technique which uses a single, local transformation — called the foldr-build rule — to remove certain intermed...
FSTTCS
2004
Springer
13 years 10 months ago
2004
Springer
When studying a 3D polyhedron, it is often easier to cut it open and
atten in on the plane. There are several ways to perform this unfolding. Standard unfoldings which have been u...
ECCB
2008
IEEE
13 years 6 months ago
2008
IEEE
ent> <title> <p>Highlights from the Fourth International Society for Computational Biology (ISCB) Student Council Symposium</p> </title> <editor>Lu...