Sciweavers

1480 search results - page 26 / 296
» Ants can solve constraint satisfaction problems
Sort
View
FLAIRS
2006
14 years 10 days ago
Full Restart Speeds Learning
Because many real-world problems can be represented and solved as constraint satisfaction problems, the development of effective, efficient constraint solvers is important. A solv...
Smiljana Petrovic, Susan L. Epstein
CP
2005
Springer
14 years 4 months ago
Conditional Symmetry Breaking
Conditional symmetry arises in a sub-problem of a constraint satisfaction problem, where the sub-problem satisfies some condition under which additional symetries hold. Typically...
Ian P. Gent, Tom Kelsey, Steve Linton, Iain McDona...
IJCAI
1989
14 years 3 days ago
Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems
This paper presents an evaluation of two orthogonal schemes for improving the efficiency of solving constraint satisfaction problems (CSPs). The first scheme involves a class of p...
Rina Dechter, Itay Meiri
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 5 months ago
Self-adaptive ant colony optimisation applied to function allocation in vehicle networks
Modern vehicles possess an increasing number of software and hardware components that are integrated in electronic control units (ECUs). Finding an optimal allocation for all comp...
Manuel Förster, Bettina Bickel, Bernd Hardung...
CSR
2010
Springer
14 years 3 months ago
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
Uwe Schöning