Sciweavers

3221 search results - page 340 / 645
» Termination of Linear Programs
Sort
View
MP
1998
109views more  MP 1998»
15 years 6 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
PPDP
2010
Springer
15 years 5 months ago
Equational axiomatization of call-by-name delimited control
Control operators for delimited continuations are useful in various fields such as partial evaluation, CPS translation, and representation of monadic effects. While many works in...
Yukiyoshi Kameyama, Asami Tanaka
APLAS
2010
ACM
15 years 4 months ago
Live Heap Space Bounds for Real-Time Systems
Live heap space analyses have so far been concerned with the standard sequential programming model. However, that model is not very well suited for embedded real-time systems, wher...
Martin Kero, Pawel Pietrzak, Johan Nordlander
DAC
2009
ACM
16 years 7 months ago
Retiming and recycling for elastic systems with early evaluation
Retiming and recycling are two transformations used to optimize the performance of latency-insensitive (a.k.a. synchronous elastic) systems. This paper presents an approach that c...
Dmitry Bufistov, Jordi Cortadella, Marc Galceran O...
VLSID
2008
IEEE
153views VLSI» more  VLSID 2008»
16 years 7 months ago
Total Power Minimization in Glitch-Free CMOS Circuits Considering Process Variation
Compared to subthreshold leakage, dynamic power is normally much less sensitive to the process variation due to its approximately linear relation to the process parameters. Howeve...
Yuanlin Lu, Vishwani D. Agrawal