466 search results - page 21 / 94 » A Worst Case Timing Analysis Technique for Optimized Program... |
ISIPTA
2003
IEEE
14 years 1 months ago
2003
IEEE
We generalise the optimisation technique of dynamic programming for discretetime systems with an uncertain gain function. We assume that uncertainty about the gain function is des...
CGO
2010
IEEE
14 years 3 months ago
2010
IEEE
Reducing the arithmetic precision of a computation has real performance implications, including increased speed, decreased power consumption, and a smaller memory footprint. For s...
EOR
2007
13 years 8 months ago
2007
Motivated by an underground mining operation at Kiruna, Sweden, we formulate a mixed integer program to schedule iron ore production over multiple time periods. Our optimization m...
NETWORKING
2008
13 years 10 months ago
2008
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...
DAC
2008
ACM
14 years 9 months ago
2008
ACM
A fundamental problem in timing-driven physical synthesis is the reduction of critical paths in a design. In this work, we propose a powerful new technique that moves (and can als...