Our algorithm, ParaMor, fared well in Morpho Challenge 2007 (Kurimo et al., 2007), a peer operated competition pitting against one another algorithms designed to discover the morp...
Christian Monson, Jaime G. Carbonell, Alon Lavie, ...
Abstract. Alcatel-Lucent is a major player in the eld of telecommunications. One of the products it oers to network operators is wireless infrastructure such as base stations. Su...
Roman van der Krogt, James Little, Kenneth Pulliam...
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...
Abstract. There is no standard modelling language for constraint programming (CP) problems. Most solvers have their own modelling language. This makes it difficult for modellers to...
Nicholas Nethercote, Peter J. Stuckey, Ralph Becke...