Sciweavers

3352 search results - page 340 / 671
» Hierarchical Problem Solving and the Bayesian Optimization A...
Sort
View
IPPS
1997
IEEE
15 years 11 months ago
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
Yuji Shinano, Kenichi Harada, Ryuichi Hirabayashi
ICML
2002
IEEE
16 years 7 months ago
Learning from Scarce Experience
Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each ...
Leonid Peshkin, Christian R. Shelton
ICAC
2007
IEEE
16 years 1 months ago
Approximation Modeling for the Online Performance Management of Distributed Computing Systems
—A promising method of automating management tasks in computing systems is to formulate them as control or optimization problems in terms of performance metrics. For an online op...
Dara Kusic, Nagarajan Kandasamy, Guofei Jiang
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
13 years 9 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
CIG
2005
IEEE
16 years 8 days ago
Case-Injection Improves Response Time for a Real-Time Strategy Game
We present a case-injected genetic algorithm player for Strike Ops, a real-time strategy game. Such strategy games are fundamentally resource allocation optimization problems and o...
Chris Miles, Sushil J. Louis