L. Schoofs and B. Naudts. Solving CSPs with ant colonies. In Abst. Proc. ANTS'2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
ACO for Maximal Constraint Satisfaction Problems - Roli, Blum, Dorigo (2001) (2 citations) (Correct)
....apply the state transition rule to select the value to assign. The way of assigning values to variables used in [8] can be covered by our approach if we change the de nition of feasible neighborhood for the ants. Di erent approaches which do not exactly t into the ACO paradigm are presented in [9, 7]. Future work is directed to the extension of the presented representations to other combinatorial optimization problems with a CSP formulation and to problems with a 0 1 formulation (like the knapsack problem) Furthermore, we are currently implementing ACS in a reduced graph representation, ....
L. Schoofs and B. Naudts. Solving CSPs with ant colonies. In Abst. Proc. ANTS'2000, 2000.
ACO for Maximal Constraint Satisfaction Problems - Andrea Roli Christian (2001) (2 citations) (Correct)
No context found.
L. Schoofs and B. Naudts. Solving CSPs with ant colonies. In Abst. Proc. ANTS'2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC