19130 search results - page 146 / 3826 » Modelling multi-path problems |
145
click to vote
SAT
2004
Springer
15 years 11 months ago
2004
Springer
The Walksat local search algorithm has previously been extended to handle quantification over variables. This greatly reduces model sizes, but in order to guide greedy moves the a...
165
click to vote
ICCS
2003
Springer
15 years 11 months ago
2003
Springer
Application portals, or Problem Solving Environments (PSEs), provide user environments that simplify access and integrate various distributed computational services for scientists ...
183
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Abstract. Nowadays genetic algorithms stand as a trend to solve NPcomplete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses Parallel Genetic Al...
224
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...
155
click to vote
AMC
2008
15 years 6 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 ...