Sciweavers

185 search results - page 9 / 37
» Solving problems on recursively constructed graphs
Sort
View
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
15 years 6 months ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke
ISCIS
2009
Springer
15 years 6 months ago
Construction of examination timetables based on ordering heuristics
—In this paper, we combine graph coloring heuristics, namely largest degree and saturation degree with the concept of a heuristic modifier under the framework of squeaky wheel op...
Syariza Abdul Rahman, Andrzej Bargiela, Edmund K. ...
JAVA
2000
Springer
15 years 3 months ago
A Java fork/join framework
This paper describes the design, implementation, and performance of a Java framework for supporting a style of parallel programming in which problems are solved by (recursively) s...
Doug Lea
JUCS
2010
148views more  JUCS 2010»
14 years 10 months ago
Applying RFD to Construct Optimal Quality-Investment Trees
: River Formation Dynamics (RFD) is an evolutionary computation method based on copying how drops form rivers by eroding the ground and depositing sediments. Given a cost-evaluated...
Pablo Rabanal, Ismael Rodríguez, Fernando R...
CEC
2009
IEEE
15 years 4 months ago
Grammar-based genetic programming for timetabling
Abstract— We present a grammar-based genetic programming framework for the solving the timetabling problem via the evolution of constructive heuristics. The grammar used for prod...
Mohamed Bahy El Bader-El-Den, Riccardo Poli