1197 search results - page 18 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
The problem of expressing and solving satisfiability problems (SAT) with qualitative preferences is central in many areas of Computer Science and Artificial Intelligence. In previo...
AAAI
2007
13 years 10 months ago
2007
Solving logic puzzles has become a very popular past-time, particularly since the Sudoku puzzle started appearing in newspapers all over the world. We have developed a puzzle gene...
IJCAI
1989
13 years 9 months ago
1989
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de sign task takes as input the specifications of the desired functions of a device...
TSMC
2010
13 years 2 months ago
2010
Abstract--The multimode resource-constrained projectscheduling problem with discounted cash flows (MRCPSPDCF) is important and challenging for project management. As the problem is...
ISSTA
2004
ACM
14 years 1 months ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...