Sciweavers

79 search results - page 14 / 16
» Strategies for Solving SAT in Grids by Randomized Search
Sort
View
GECCO
2009
Springer
162views Optimization» more  GECCO 2009»
14 years 7 months ago
Uncertainty handling CMA-ES for reinforcement learning
The covariance matrix adaptation evolution strategy (CMAES) has proven to be a powerful method for reinforcement learning (RL). Recently, the CMA-ES has been augmented with an ada...
Verena Heidrich-Meisner, Christian Igel
CEC
2009
IEEE
15 years 4 months ago
Examination timetabling using late acceptance hyper-heuristics
— A hyperheuristic is a high level problem solving methodology that performs a search over the space generated by a set of low level heuristics. One of the hyperheuristic framewo...
Ender Özcan, Yuri Bykov, Murat Birben, Edmund...
CP
2006
Springer
15 years 1 months ago
Adaptive Clause Weight Redistribution
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
Abdelraouf Ishtaiwi, John Thornton, Anbulagan, Abd...
CIBCB
2009
IEEE
14 years 10 months ago
rnaDesign: Local search for RNA secondary structure design
Abstract-- The RNA secondary structure design (SSD) problem is a recently emerging research topic motivated by applications such as customized drug design and the self-assembly of ...
Denny C. Dai, Herbert H. Tsang, Kay C. Wiese
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
14 years 10 months ago
A hybrid method for tuning neural network for time series forecasting
This paper presents an study about a new Hybrid method GRASPES - for time series prediction, inspired in F. Takens theorem and based on a multi-start metaheuristic for combinatori...
Aranildo Rodrigues Lima Junior, Tiago Alessandro E...