Sciweavers

23 search results - page 3 / 5
» Learning Inadmissible Heuristics During Search
Sort
View
ML
2008
ACM
156views Machine Learning» more  ML 2008»
13 years 7 months ago
On the connection between the phase transition of the covering test and the learning success rate in ILP
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
Érick Alphonse, Aomar Osmani
BPM
2009
Springer
116views Business» more  BPM 2009»
14 years 2 months ago
Discovering Reference Models by Mining Process Variants Using a Heuristic Approach
Abstract. Recently, a new generation of adaptive Process-Aware Information Systems (PAISs) has emerged, which enables structural process changes during runtime. Such flexibility, ...
Chen Li, Manfred Reichert, Andreas Wombacher
AI
1998
Springer
13 years 11 months ago
A Hybrid Convergent Method for Learning Probabilistic Networks
During past few years, a variety of methods have been developed for learning probabilistic networks from data, among which the heuristic single link forward or backward searches ar...
Jun Liu, Kuo-Chu Chang, Jing Zhou
LION
2007
Springer
192views Optimization» more  LION 2007»
14 years 1 months ago
Learning While Optimizing an Unknown Fitness Surface
This paper is about Reinforcement Learning (RL) applied to online parameter tuning in Stochastic Local Search (SLS) methods. In particular a novel application of RL is considered i...
Roberto Battiti, Mauro Brunato, Paolo Campigotto
GECCO
2006
Springer
188views Optimization» more  GECCO 2006»
13 years 11 months ago
Dominance learning in diploid genetic algorithms for dynamic optimization problems
This paper proposes an adaptive dominance mechanism for diploidy genetic algorithms in dynamic environments. In this scheme, the genotype to phenotype mapping in each gene locus i...
Shengxiang Yang