Sciweavers

393 search results - page 66 / 79
» Convex Programming Methods for Global Optimization
Sort
View
CORR
2007
Springer
130views Education» more  CORR 2007»
13 years 7 months ago
Lagrangian Relaxation for MAP Estimation in Graphical Models
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
Jason K. Johnson, Dmitry M. Malioutov, Alan S. Wil...
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
14 years 2 months ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke
CDC
2009
IEEE
129views Control Systems» more  CDC 2009»
14 years 7 days ago
Resource allocation for signal detection with active sensors
— We consider the problem of determining the existence of known constant signals over a set of sites, given noisy measurements obtained by a team of active sensors that can switc...
Jerome Le Ny, Michael M. Zavlanos, George J. Pappa...
GECCO
2005
Springer
103views Optimization» more  GECCO 2005»
14 years 1 months ago
Pricing the 'free lunch' of meta-evolution
A number of recent studies introduced meta-evolutionary strategies and successfully used them for solving problems in genetic programming. While individual results indicate possib...
Alexei V. Samsonovich, Kenneth A. De Jong
DAC
2005
ACM
13 years 9 months ago
Total power reduction in CMOS circuits via gate sizing and multiple threshold voltages
Minimizing power consumption is one of the most important objectives in IC design. Resizing gates and assigning different Vt’s are common ways to meet power and timing budgets. ...
Feng Gao, John P. Hayes