Sciweavers

204 search results - page 6 / 41
» Heuristics for Dynamically Adapting Propagation
Sort
View
UAI
2003
13 years 9 months ago
Systematic vs. Non-systematic Algorithms for Solving the MPE Task
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
Radu Marinescu 0002, Kalev Kask, Rina Dechter
NPL
2006
109views more  NPL 2006»
13 years 7 months ago
CB3: An Adaptive Error Function for Backpropagation Training
Effective backpropagation training of multi-layer perceptrons depends on the incorporation of an appropriate error or objective function. Classification-based (CB) error functions ...
Michael Rimer, Tony Martinez
ENDM
2010
167views more  ENDM 2010»
13 years 5 months ago
Column Generation based Primal Heuristics
In the past decade, significant progress has been achieved in developing generic primal heuristics that made their way into commercial mixed integer programming (MIP) solver. Exte...
C. Joncour, S. Michel, R. Sadykov, D. Sverdlov, Fr...
AUSAI
2003
Springer
14 years 28 days ago
Guided Operators for a Hyper-Heuristic Genetic Algorithm
We have recently introduced a hyper-heuristic genetic algorithm (hyper-GA) with an adaptive length chromosome which aims to evolve an ordering of low-level heuristics so as to find...
Limin Han, Graham Kendall
CORR
2008
Springer
153views Education» more  CORR 2008»
13 years 7 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...