1171 search results - page 121 / 235 » Variable neighborhood search |
ICML
2002
IEEE
14 years 10 months ago
2002
IEEE
An open problem in reinforcement learning is discovering hierarchical structure. HEXQ, an algorithm which automatically attempts to decompose and solve a model-free factored MDP h...
ATAL
2009
Springer
14 years 4 months ago
2009
Springer
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...
GECCO
2005
Springer
14 years 3 months ago
2005
Springer
This paper proposes a novel technique for a program evolution based on probabilistic models. In the proposed method, two probabilistic distribution models with probabilistic depen...
AIPS
2000
13 years 11 months ago
2000
We will discuss the shortcomings of known variable and value ordering strategies for Graphplan's backward search phase, and propose a novel strategy that is based on a notion...
AAAI
2007
14 years 10 days ago
2007
Sparsity-promoting L1-regularization has recently been succesfully used to learn the structure of undirected graphical models. In this paper, we apply this technique to learn the ...