Sciweavers

500 search results - page 34 / 100
» A Sample Approximation Approach for Optimization with Probab...
Sort
View
KSEM
2009
Springer
14 years 2 months ago
A Competitive Learning Approach to Instance Selection for Support Vector Machines
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
Mario Zechner, Michael Granitzer
EMO
2009
Springer
174views Optimization» more  EMO 2009»
14 years 2 months ago
Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
Pascal Van Hentenryck
ICDM
2007
IEEE
148views Data Mining» more  ICDM 2007»
13 years 11 months ago
Sample Selection for Maximal Diversity
The problem of selecting a sample subset sufficient to preserve diversity arises in many applications. One example is in the design of recombinant inbred lines (RIL) for genetic a...
Feng Pan, Adam Roberts, Leonard McMillan, David Th...
AUTOMATICA
2008
114views more  AUTOMATICA 2008»
13 years 8 months ago
A synthesis approach for output feedback robust constrained model predictive control
This paper addresses the synthesis approach to output feedback robust model predictive control for systems with polytopic description, bounded state disturbance and measurement no...
BaoCang Ding, YuGeng Xi, Marcin T. Cychowski, Thom...
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
14 years 2 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu