1171 search results - page 134 / 235 » Variable neighborhood search |
IJCAI
1993
13 years 11 months ago
1993
Heuristics used by search algorithms are usually composed of more primitive functions which we call "features". A method for combining features is presented which is bas...
IJCAI
1989
13 years 11 months ago
1989
Potentially, the advantages of marker-passing over local connectionist techniques for associa tive inference are (1) the ability to differen tiate variable bindings, and (2) r...
AMC
2008
13 years 10 months ago
2008
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
CONSTRAINTS
2006
13 years 10 months ago
2006
Covering arrays can be applied to the testing of software, hardware and advanced materials, and to the effects of hormone interaction on gene expression. In this paper we develop c...
CONSTRAINTS
2007
13 years 10 months ago
2007
We study the “inter-distance constraint”, also known as the global minimum distance constraint, that ensures that the distance between any pair of variables is at least equal ...