FCA interpretation of relation algebra.
Conference Proceeding
Priss, U. (2006)
FCA interpretation of relation algebra. https://doi.org/10.1007/11671404_17
This paper discusses an interpretation of relation algebra and fork algebra with respect to FCA contexts. In this case, "relation algebra" refers to the DeMorgan-Peirce-Schroe...
Finding feasible timetables using group-based operators.
Journal Article
Lewis, R. M. R. & Paechter, B. (2007)
Finding feasible timetables using group-based operators. IEEE Transactions on Evolutionary Computation. 11, 397-413. doi:10.1109/TEVC.2006.885162. ISSN 1089-778X
This paper describes the applicability of the so-called "grouping genetic algorithm" to a well-known version of the university course timetabling problem. We note that there a...
Hyper-heuristics: learning to combine simple heuristics in bin-packing problems.
Conference Proceeding
Ross, P., Schulenburg, S., Marin-Blazquez, J. G. & Hart, E. (2002)
Hyper-heuristics: learning to combine simple heuristics in bin-packing problems. ISBN 1558608788
Evolutionary algorithms (EAs) often appear to be a ‘black box’, neither offering worst-case bounds nor any guarantee of optimality when used to solve individual problems. They...
Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyperheuristics.
Conference Proceeding
Ross, P., Marin-Blazquez, J. G., Schulenburg, S. & Hart, E. (2003)
Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyperheuristics
The idea underlying hyper-heuristics is to discover some
combination of familiar, straightforward heuristics that performs very well across a whole range of problems. To be wo...