Sciweavers

1480 search results - page 92 / 296
» Ants can solve constraint satisfaction problems
Sort
View
CP
2004
Springer
15 years 3 months ago
Constraint-Based Combinators for Local Search
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
Pascal Van Hentenryck, Laurent Michel, Liyuan Liu
TSE
2008
107views more  TSE 2008»
14 years 9 months ago
Security Requirements Engineering: A Framework for Representation and Analysis
This paper presents a framework for security requirements elicitation and analysis. The framework is based on constructing a context for the system, representing security requireme...
Charles B. Haley, Robin C. Laney, Jonathan D. Moff...
ATAL
2003
Springer
15 years 3 months ago
Trade of a problem-solving task
This paper focuses on a task allocation problem, particularly in cases where the task is to find a solution to a search problem or a constraint satisfaction problem. If the searc...
Shigeo Matsubara
SAC
1994
ACM
15 years 1 months ago
Extending a parallel CLP language to support the development of multi-agent systems
An extension of Me parallel constraint logic programming language ElipSys is presented. This extension is directed towards the development of multi-agent systems which have to dea...
Panagiotis Stamatopoulos, Dimitris Margaritis, Con...
IS
2007
14 years 9 months ago
Semantic optimization techniques for preference queries
Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). Such queries are pa...
Jan Chomicki