955 search results - page 63 / 191 » A System for Solving Constraint Satisfaction Problems with S... |
COMPULOG
1999
Springer
14 years 9 days ago
1999
Springer
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
IJCAI
2003
13 years 9 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...
SAC
2003
ACM
14 years 1 months ago
2003
ACM
Many information systems are used in a problem solving context. Examples are travel planning systems, catalogs in electronic commerce, or agenda planning systems. They can be made...
AIPS
2000
13 years 9 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
SGAI
2007
Springer
14 years 2 months ago
2007
Springer
Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the cons...