16082 search results - page 230 / 3217 » Fireworks Algorithm for Optimization |
127
click to vote
DAC
1996
ACM
15 years 7 months ago
1996
ACM
In this paper, we study the problem of decomposing gates in fanin-unbounded or K-bounded networks such that the K-input LUT mapping solutions computed by a depthoptimal mapper hav...
133
Voted
STOC
1989
ACM
15 years 7 months ago
1989
ACM
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division nding reciprocals that...
124
Voted
ANCS
2007
ACM
15 years 7 months ago
2007
ACM
All-optical packet switching is a promising candidate for future high-speed switching. However, due to the absence of optical Random Access Memory, the traditional Virtual Output ...
124
Voted
ASPDAC
2007
ACM
15 years 7 months ago
2007
ACM
Power grid networks in VLSI circuits are required to provide adequate input supply to ensure reliable performance. In this paper, we propose algorithms to find the placement of pow...
126
Voted
ICANNGA
2009
Springer
15 years 7 months ago
2009
Springer
A new evolutionary algorithm, Elitistic Evolution (termed EEv), is proposed in this paper. EEv is an evolutionary method for numerical optimization with adaptive behavior. EEv uses...