62 search results - page 11 / 13 » Intelligent Backtracking Techniques for Job Shop Scheduling |
HPDC
2003
IEEE
13 years 11 months ago
2003
IEEE
The Grid is realizing the vision of providing computation as utility: computation jobs can be scheduled on-demand in Grid hosts based on available computation capacity. In this pa...
CP
2007
Springer
14 years 10 days ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
AAAI
1994
13 years 7 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
IJCAI
1989
13 years 7 months ago
1989
Cognitive architectures aspire for generality both in terms of problem solving and learning across a range of problems, yet to date few examples of domain independent learning has...
MI
1993
13 years 7 months ago
1993
AI planning research is now maturing and nding practical application in the commercial, industrial, engineering and defence sectors. This has led to a rapid expansion in the last ...