Sciweavers

1477 search results - page 136 / 296
» Random Convex Programs
Sort
View
GECCO
2003
Springer
14 years 2 months ago
Methods for Evolving Robust Programs
Many evolutionary computation search spaces require fitness assessment through the sampling of and generalization over a large set of possible cases as input. Such spaces seem par...
Liviu Panait, Sean Luke
EOR
2011
134views more  EOR 2011»
13 years 3 months ago
Linear programming based decomposition methods for inventory distribution systems
We consider an inventory distribution system consisting of one warehouse and multiple retailers. The retailers face random demand and are supplied by the warehouse. The warehouse ...
Sumit Kunnumkal, Huseyin Topaloglu
CPAIOR
2006
Springer
14 years 20 days ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
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...
HICSS
2007
IEEE
139views Biometrics» more  HICSS 2007»
14 years 3 months ago
Experiences of Using Pair Programming in an Agile Project
The interest in pair programming (PP) has increased recently, e.g. by the popularization of agile software development. However, many practicalities of PP are poorly understood. W...
Jari Vanhanen, Harri Korpi