Sciweavers

319 search results - page 51 / 64
» Robust Solutions in Unstable Optimization Problems
Sort
View
CONEXT
2005
ACM
13 years 10 months ago
TIE breaking: tunable interdomain egress selection
— The separation of intradomain and interdomain routing has been a key feature of the Internet’s routing architecture from the early days of the ARPAnet. However, the appropria...
Renata Teixeira, Timothy G. Griffin, Mauricio G. C...
MICCAI
2007
Springer
14 years 9 months ago
Shape Analysis Using a Point-Based Statistical Shape Model Built on Correspondence Probabilities
A fundamental problem when computing statistical shape models is the determination of correspondences between the instances of the associated data set. Often, homologies between po...
Heike Hufnagel, Xavier Pennec, Jan Ehrhardt, Heinz...
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
14 years 3 months ago
A study on metamodeling techniques, ensembles, and multi-surrogates in evolutionary computation
Surrogate-Assisted Memetic Algorithm(SAMA) is a hybrid evolutionary algorithm, particularly a memetic algorithm that employs surrogate models in the optimization search. Since mos...
Dudy Lim, Yew-Soon Ong, Yaochu Jin, Bernhard Sendh...
ISQED
2010
IEEE
123views Hardware» more  ISQED 2010»
13 years 10 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...
CORR
2010
Springer
198views Education» more  CORR 2010»
13 years 5 months ago
Convex Graph Invariants
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...