810 search results - page 107 / 162 » Solving Time-Dependent Planning Problems |
COMSNETS
2012
12 years 3 months ago
2012
Abstract—Detecting and localizing performance faults is crucial for operating large enterprise data centers. This problem is relatively straightforward to solve if each entity (a...
AAAI
1997
13 years 9 months ago
1997
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
AGILEDC
2007
IEEE
14 years 2 months ago
2007
IEEE
A complex Enterprise Relationship Planning (ERP) data migration was in trouble: low quality, poor performance, instability, and an overworked team threatened project success. Faci...
PAKDD
2005
ACM
14 years 1 months ago
2005
ACM
This paper presents the advances in subgroup discovery and the ways to use subgroup discovery to generate actionable knowledge for decision support. Actionable knowledge is explici...
KR
2004
Springer
14 years 1 months ago
2004
Springer
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...