434 search results - page 45 / 87 » Constraint-Based Combinators for Local Search |
130
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
Abstract. Constraint logic programming combines declarativity and efficiency thanks to constraint solvers implemented for specific domains. Value withdrawal explanations have been ...
150
click to vote
IPM
2007
15 years 5 months ago
2007
The performance of parallel query processing in a cluster of index servers is crucial for modern web search systems. In such a scenario, the response time basically depends on the...
168
Voted
BMCBI
2005
15 years 5 months ago
2005
Background: High throughput microarray analyses result in many differentially expressed genes that are potentially responsible for the biological process of interest. In order to ...
126
Voted
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
A common problem in genetic programming search algorithms is destructive crossover in which the offspring of good parents generally has worse performance than the parents. Design...
150
Voted
EVOW
2004
Springer
15 years 10 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...