9842 search results - page 1482 / 1969 » Compositional timing analysis |
174
click to vote
TCS
2008
15 years 6 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
223
click to vote
TIP
2008
15 years 6 months ago
2008
Consider the problem of transmitting multiple video streams to fulfill a constant bandwidth constraint. The available bit budget needs to be distributed across the sequences in ord...
159
click to vote
IOR
2002
15 years 6 months ago
2002
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...
199
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
Abstract. String matching is rich with a variety of algorithmic tools. In contrast, multidimensional matching has had a rather sparse set of techniques. This paper presents a new a...
214
click to vote
COR
2007
15 years 6 months ago
2007
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...