1171 search results - page 179 / 235 » Variable neighborhood search |
AI
2003
Springer
14 years 3 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
LATA
2010
Springer
14 years 3 months ago
2010
Springer
With the advent of new sequencing technologies able to produce an enormous quantity of short genomic sequences, new tools able to search for them inside a references sequence genom...
CP
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. Among backtracking based algorithms for constraint satisfaction problems (CSPs), algorithms employing constraint propagation, like forward checking (FC) and MAC, have had...
HYBRID
1994
Springer
14 years 1 months ago
1994
Springer
This paper presents algorithms for the symbolic synthesis of discrete and real-time controllers. At the semantic level the controller is synthesized by nding a winning strategy for...
SIGIR
2010
ACM
14 years 1 months ago
2010
ACM
Diversity has been heavily motivated in the information retrieval literature as an objective criterion for result sets in search and recommender systems. Perhaps one of the most w...