3250 search results - page 553 / 650 » An Algorithm to Solve a Linear Program |
115
Voted
PEPM
2000
ACM
15 years 6 months ago
2000
ACM
Many program optimisations and analyses, such as arraybound checking, termination analysis, etc, dependon knowing the size of a function's input and output. However, size inf...
114
Voted
CSR
2008
Springer
15 years 4 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
97
Voted
DAC
2010
ACM
15 years 2 months ago
2010
ACM
We study diagnosis of segments on speedpaths that fail the timing constraint at the post-silicon stage due to manufacturing variations. We propose a formal procedure that is appli...
140
Voted
ISLPED
2010
ACM
15 years 2 months ago
2010
ACM
We have developed a system architecture, measuring and modeling techniques, and algorithms for on-line power and energy optimization and thermal management. The starting point for...
140
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...