1480 search results - page 107 / 296 » Ants can solve constraint satisfaction problems |
ILP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logic programming. In this paper we ...
112
click to vote
ECAI
1992
Springer
15 years 1 months ago
1992
Springer
Constraint satisfaction problems (CSPs) provide a model often used in Artificial Intelligence. Since the problem of the existence of a solution in a CSP is an NP-complete task, man...
ICHIT
2009
Springer
15 years 4 months ago
2009
Springer
In this application of artificial intelligence to a real-world problem, the constrained scheduling of employee resourcing for a mall type shop is solved by means of a genetic algo...
IJCAI
2003
14 years 11 months ago
2003
The structural rigidity property, a generalization of Laman’s theorem which characterizes rigid bar frameworks in 2D, is generally considered a good approximation of rigidity in...
104
click to vote
ICCBR
2009
Springer
14 years 7 months ago
2009
Springer
Previous approaches to case-based planning often finds a similar plan case to a new planning problem to adapt to solve the new problem. However, in the case base, there may be some...