466 search results - page 31 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
109
click to vote
CG
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
Rocchio’s similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised lear...
DCC
2008
IEEE
15 years 11 months ago
2008
IEEE
We present improved lower bounds on the sizes of small maximal partial ovoids in the classical hermitian polar spaces, and improved upper bounds on the sizes of large maximal part...
ATAL
2010
Springer
15 years 27 days ago
2010
Springer
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...