985 search results - page 169 / 197 » Piercing Convex Sets |
ASIAN
2006
Springer
13 years 11 months ago
2006
Springer
Polyhedral analysis [9] is an abstract interpretation used for automatic discovery of invariant linear inequalities among numerical varia program. Convexity of this abstract domain...
CPAIOR
2010
Springer
13 years 11 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
This demonstration shows an agent-based model for the electricity power market, in which the optimal power flow is determined in a bottom-up fashion. Here, each agent controls a s...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
AAAI
2010
13 years 9 months ago
2010
Multiple Kernel Learning (MKL) can be formulated as a convex-concave minmax optimization problem, whose saddle point corresponds to the optimal solution to MKL. Most MKL methods e...