Sciweavers

121 search results - page 14 / 25
» Optimizing the CVaR via Sampling
Sort
View
ISQED
2010
IEEE
123views Hardware» more  ISQED 2010»
13 years 11 months ago
Yield-constrained digital circuit sizing via sequential geometric programming
Circuit design under process variation can be formulated mathematically as a robust optimization problem with a yield constraint. Existing methods force designers to either resort...
Yu Ben, Laurent El Ghaoui, Kameshwar Poolla, Costa...
DAC
2005
ACM
13 years 11 months ago
Power grid simulation via efficient sampling-based sensitivity analysis and hierarchical symbolic relaxation
On-chip supply networks are playing an increasingly important role for modern nanometer-scale designs. However, the ever growing sizes of power grids make the analysis problem ext...
Peng Li
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
14 years 11 months ago
Greedy List Intersection
A common technique for processing conjunctive queries is to first match each predicate separately using an index lookup, and then compute the intersection of the resulting rowid li...
Robert Krauthgamer, Aranyak Mehta, Vijayshankar Ra...
GECCO
2004
Springer
14 years 3 months ago
Fitness Clouds and Problem Hardness in Genetic Programming
This paper presents an investigation of genetic programming fitness landscapes. We propose a new indicator of problem hardness for tree-based genetic programming, called negative ...
Leonardo Vanneschi, Manuel Clergue, Philippe Colla...
PAKDD
2004
ACM
96views Data Mining» more  PAKDD 2004»
14 years 3 months ago
Spectral Energy Minimization for Semi-supervised Learning
The use of unlabeled data to aid classification is important as labeled data is often available in limited quantity. Instead of utilizing training samples directly into semi-super...
Chun Hung Li, Zhi-Li Wu