1480 search results - page 82 / 296 » Ants can solve constraint satisfaction problems |
IJCAI
2007
14 years 11 months ago
2007
Constraint Satisfaction Problems (CSPs) are ubiquitous in Artificial Intelligence. The backtrack algorithms that maintain some local consistency during search have become the de ...
CP
2001
Springer
15 years 2 months ago
2001
Springer
In interactive graphical applications we often require that objects do not overlap. Such non-overlap constraints can be modelled as disjunctions of arithmetic inequalities. Unfortu...
KBS
2007
14 years 9 months ago
2007
Restaurant table management can have significant impact on both profitability and the customer experience. The core of the issue is a complex dynamic combinatorial problem. We sho...
106
click to vote
EOR
2006
14 years 9 months ago
2006
One of the most important, common and critical management issues lies in determining the "best" project portfolio out of a given set of investment proposals. As this dec...
123
click to vote
CSCLP
2008
Springer
14 years 11 months ago
2008
Springer
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...