6365 search results - page 981 / 1273 » Fast Local Computation Algorithms |
181
click to vote
ICCAD
2007
IEEE
16 years 3 months ago
2007
IEEE
—As the 193nm lithography is likely to be used for 45nm and even 32nm processes, much more stringent requirement will be posed on Optical Proximity Correction (OPC) technologies....
195
click to vote
ICCAD
2007
IEEE
16 years 3 months ago
2007
IEEE
Among the post-CMOS technologies currently under investigation, quantum computing (QC) holds a special place. QC offers not only extremely small size and low power, but also expon...
225
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
187
click to vote
ISBRA
2010
Springer
16 years 1 months ago
2010
Springer
d abstract), Nicola Ferraro, Luigi Palopoli, Simona Panni and Simona E. Rombo. Uncovering Hidden Phylogenetic Consensus d abstract), Nicholas Pattengale, Krister Swenson and Bernar...
196
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— This paper proposes a novel two-stage optimization method for robust Model Predictive Control (RMPC) with Gaussian disturbance and state estimation error. Since the dis...