The objective of this work is to derive quantitative statements about what fraction of web search queries issued to the state-of-the-art commercial search engines lead to excellen...
Hugo Zaragoza, Berkant Barla Cambazoglu, Ricardo A...
Case-based reasoning (CBR) aims at using experience from the past in order to guide future problem solving rather than “starting from scratch” every time. We propose a CBR stra...
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
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...