Sciweavers

12519 search results - page 227 / 2504
» Approximation Problems Categories
Sort
View
GLVLSI
2003
IEEE
219views VLSI» more  GLVLSI 2003»
15 years 11 months ago
Buffer sizing for minimum energy-delay product by using an approximating polynomial
This paper first presents an accurate and efficient method of estimating the short circuit energy dissipation and the output transition time of CMOS buffers. Next the paper descri...
Chang Woo Kang, Soroush Abbaspour, Massoud Pedram
SIGGRAPH
1997
ACM
15 years 10 months ago
Non-linear approximation of reflectance functions
We introduce a new class of primitive functions with non-linear parameters for representing light reflectance functions. The functions are reciprocal, energy-conserving and expres...
Eric P. Lafortune, Sing-Choong Foo, Kenneth E. Tor...
MFCS
2005
Springer
16 years 14 hour ago
Explicit Inapproximability Bounds for the Shortest Superstring Problem
Abstract. Given a set of strings S = {s1, . . . , sn}, the Shortest Superstring problem asks for the shortest string s which contains each si as a substring. We consider two measur...
Virginia Vassilevska
GECCO
2004
Springer
117views Optimization» more  GECCO 2004»
15 years 12 months ago
Comparing Search Algorithms for the Temperature Inversion Problem
Several inverse problems exist in the atmospheric sciences that are computationally costly when using traditional gradient based methods. Unfortunately, many standard evolutionary ...
Monte Lunacek, L. Darrell Whitley, Philip Gabriel,...
ICALP
2004
Springer
15 years 12 months ago
The Minimum-Entropy Set Cover Problem
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
Eran Halperin, Richard M. Karp