534 search results - page 73 / 107 » Efficient polynomial L-approximations |
ICCAD
1994
IEEE
13 years 12 months ago
1994
IEEE
In this paper, we study the simultaneousdriver and wire sizing (SDWS) problem under two objective functions: (i) delay minimization only, or (ii) combined delay and power dissipat...
ICCAD
1994
IEEE
13 years 12 months ago
1994
IEEE
Several industrial FPGA routing architectures have been shown to have no efficient routing algorithms (unless P=NP) [3,4]. Here, we further investigate if the intractability of th...
GECCO
2010
Springer
13 years 11 months ago
2010
Springer
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
CAAN
2007
Springer
13 years 11 months ago
2007
Springer
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
DOCENG
2007
ACM
13 years 11 months ago
2007
ACM
This paper presents a document image thresholding technique that binarizes badly illuminated document images by the photometric correction. Based on the observation that illuminat...