Sciweavers

2109 search results - page 51 / 422
» Solving Necklace Constraint Problems
Sort
View
ICWL
2007
Springer
15 years 10 months ago
Using Constraint-Based Modelling to Describe the Solution Space of Ill-defined Problems in Logic Programming
Intelligent Tutoring Systems have made great strides in recent years. Many of these gains have been achieved for welldefined problems. However, solving ill-defined problems is imp...
Nguyen-Thinh Le, Wolfgang Menzel
CSR
2010
Springer
15 years 9 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
CEC
2005
IEEE
15 years 10 months ago
Hybrid evolutionary algorithms for constraint satisfaction problems: memetic overkill?
We study a selected group of hybrid EAs for solving CSPs, consisting of the best performing EAs from the literature. We investigate the contribution of the evolutionary component t...
Bart G. W. Craenen, A. E. Eiben
AAAI
2007
15 years 6 months ago
A Distributed Constraint Optimization Solution to the P2P Video Streaming Problem
The future success of application layer video multicast depends on the availability of video stream distribution methods that can scale in the number of stream senders and receive...
Theodore Elhourani, Nathan Denny, Michael M. Maref...
FLAIRS
2003
15 years 5 months ago
Soft CLP (FD)
Over-constrained problems can be solved with the help of soft constraints. Weighted constraints are a typical representation of soft constraints used to minimize weights of unsati...
Hana Rudová