3352 search results - page 390 / 671 » Hierarchical Problem Solving and the Bayesian Optimization A... |
177
click to vote
CPAIOR
2010
Springer
15 years 10 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...
197
click to vote
AAAI
2007
15 years 9 months ago
2007
In timed, zero-sum games, the goal is to maximize the probability of winning, which is not necessarily the same as maximizing our expected reward. We consider cumulative intermedi...
187
click to vote
SASO
2010
IEEE
15 years 4 months ago
2010
IEEE
To keep pace with constantly changing markets, many companies are seeking strategic partnerships. In this paper, we assume that a company can electronically provide a profile of th...
201
click to vote
CEC
2008
IEEE
16 years 1 months ago
2008
IEEE
— Many deterministic algorithms in the context of constrained optimization require the first-order derivatives, or the gradient vectors, of the objective and constraint function...
156
click to vote
WEA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The configuration of network resources greatly impacts the communication overhead for data intensive tasks and constitutes a critical problem in the design and maintenan...