Sciweavers

1171 search results - page 139 / 235
» Variable neighborhood search
Sort
View
SIGIR
2005
ACM
14 years 3 months ago
Modeling task-genre relationships for IR in the workplace
Context influences the search process, but to date research has not definitively identified which aspects of context are the most influential for information retrieval, and thus a...
Luanne Freund, Elaine G. Toms, Charles L. A. Clark...
ECAI
2006
Springer
14 years 1 months ago
Asynchronous Forward-Bounding for Distributed Constraints Optimization
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchr...
Amir Gershman, Amnon Meisels, Roie Zivan
ECAI
2008
Springer
13 years 11 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...
AAAI
1996
13 years 11 months ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
Richard J. Wallace
CP
2011
Springer
12 years 9 months ago
Pruning Rules for Constrained Optimisation for Conditional Preferences
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
Nic Wilson, Walid Trabelsi