Sciweavers

2657 search results - page 29 / 532
» On the complexity of hierarchical problem solving
Sort
View
ECAI
2008
Springer
15 years 6 months ago
A Simulation-based Approach for Solving Generalized Semi-Markov Decision Processes
Time is a crucial variable in planning and often requires special attention since it introduces a specific structure along with additional complexity, especially in the case of dec...
Emmanuel Rachelson, Gauthier Quesnel, Fréd&...
132
Voted
IPPS
2009
IEEE
15 years 11 months ago
A parallel hybrid genetic algorithm-simulated annealing for solving Q3AP on computational grid
In this paper we propose a parallel hybrid genetic method for solving Quadratic 3-dimensional Assignment Problem (Q3AP). This problem is proved to be computationally NP-hard. The ...
Lakhdar Loukil, Malika Mehdi, Nouredine Melab, El-...
125
Voted
IPPS
2000
IEEE
15 years 9 months ago
Heuristic Solutions for a Mapping Problem in a TV-Anytime Server Network
This paper presents a novel broadband multimedia service called TV-Anytime. The basic idea of this service is to store broadcast media assets onto media server systems and allow c...
Xiaobo Zhou, Reinhard Lüling, Li Xie
UAI
2008
15 years 6 months ago
Hierarchical POMDP Controller Optimization by Likelihood Maximization
Planning can often be simplified by decomposing the task into smaller tasks arranged hierarchically. Charlin et al. [4] recently showed that the hierarchy discovery problem can be...
Marc Toussaint, Laurent Charlin, Pascal Poupart
156
Voted
JACM
2010
116views more  JACM 2010»
15 years 3 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára