1277 search results - page 44 / 256 » Terminating Decision Algorithms Optimally |
131
click to vote
COLT
2006
Springer
15 years 6 months ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
134
click to vote
AVBPA
2005
Springer
15 years 8 months ago
2005
Springer
A novel nonlinear discriminant analysis method, Kernelized Decision Boundary Analysis (KDBA), is proposed in our paper, whose Decision Boundary feature vectors are the normal vecto...
127
click to vote
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
We consider an agent-target assignment problem in an unknown environment modeled as an undirected graph. Agents do not know this graph or the locations of the targets on it. Howeve...
126
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
133
click to vote
CAV
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. STP is a decision procedure for the satisfiability of quantifier-free formulas in the theory of bit-vectors and arrays that has been optimized for large problems encoun...