We introduce novel algorithms for generating random solutions from a uniform distribution over the solutions of a boolean satisfiability problem. Our algorithms operate in two pha...
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
— The problem of robotic area coverage is applicable to many domains, such as search, agriculture, cleaning, and machine tooling. The robotic area coverage task is concerned with...
Embedded systems have an ever-increasing need for optimizing compilers to produce high quality codes with a limited general purpose register set. Either memory or registers are use...
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...