1171 search results - page 121 / 235 » Variable neighborhood search |
ICML
2002
IEEE
16 years 1 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...
111
Voted
ATAL
2009
Springer
15 years 7 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
15 years 6 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...
84
Voted
AIPS
2000
15 years 2 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...
108
Voted
AAAI
2007
15 years 3 months 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 ...