Sciweavers

1312 search results - page 85 / 263
» Formally Optimal Boxing
Sort
View
IM
2007
13 years 10 months ago
A decision support tool to optimize scheduling of IT changes
— Change management is one of the most critical processes in IT management. Some of the reasons are the sheer number of changes and the difficulty of evaluating the impact of cha...
Rodrigo Rebouças, Jacques Philippe Sauv&eac...
BDA
2004
13 years 10 months ago
A new way of optimizing OLAP queries
For around 10 years, the academic research in database has attempted to define a commonly agreed logical modeling for the multidimensional and hierarchical nature of data manipulat...
Arnaud Giacometti, Dominique Laurent, Patrick Marc...
IJCAI
2001
13 years 10 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
IJCAI
2003
13 years 10 months ago
A New Look at the Semantics and Optimization Methods of CP-Networks
Preference elicitation is a serious bottleneck in many decision support applications and agent specification tasks. CP-nets were designed to make the preference elicitation proces...
Ronen I. Brafman, Yannis Dimopoulos
CP
2011
Springer
12 years 9 months ago
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Mako...