4584 search results - page 79 / 917 » Sequential parameter optimization |
CCO
2001
Springer
15 years 2 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
109
click to vote
SDM
2011
SIAM
14 years 19 days ago
2011
SIAM
In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computationa...
ICS
2009
Tsinghua U.
15 years 2 months ago
2009
Tsinghua U.
Modern GPUs offer much computing power at a very modest cost. Even though CUDA and other related recent developments are accelerating the use of GPUs for general purpose applicati...
NN
2008
Springer
14 years 9 months ago
2008
Springer
Optimally designing the location of training input points (active learning) and choosing the best model (model selection) are two important components of supervised learning and h...
101
click to vote
AMAI
2004
Springer
15 years 3 months ago
2004
Springer
This paper extends the framework of partially observable Markov decision processes (POMDPs) to multi-agent settings by incorporating the notion of agent models into the state spac...