2976 search results - page 384 / 596 » On the bounded integer programming |
144
click to vote
SWAT
2004
Springer
15 years 12 months ago
2004
Springer
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
182
click to vote
LCTRTS
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. Previously published methods for estimation of the worstcase execution time on contemporary processors with complex pipelines and multi-level memory hierarchies result in...
174
click to vote
PLDI
1996
ACM
15 years 10 months ago
1996
ACM
Dynamic compilation enables optimizations based on the values of invariant data computed at run-time. Using the values of these runtime constants, a dynamic compiler can eliminate...
156
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Existing value function approximation methods have been successfully used in many applications, but they often lack useful a priori error bounds. We propose a new approximate bili...
153
click to vote
ACSAC
2010
IEEE
15 years 4 months ago
2010
IEEE
Leakage of confidential information represents a serious security risk. Despite a number of novel, theoretical advances, it has been unclear if and how quantitative approaches to ...