1675 search results - page 290 / 335 » Some thoughts on teaching programming and programming langua... |
CP
2005
Springer
14 years 1 months ago
2005
Springer
Classical methods for solving numerical CSPs are based on a branch and prune algorithm, a dichotomic enumeration process interleaved with a consistency filtering algorithm. In man...
CP
2005
Springer
14 years 1 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
AUSAI
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
ICALP
2003
Springer
14 years 28 days ago
2003
Springer
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...
UM
2010
Springer
14 years 24 days ago
2010
Springer
A Knowledge Worker (KW) uses her computer to perform different tasks for which she gathers and uses information from disparate sources such as the Web and e-mail, and creates new ...