810 search results - page 12 / 162 » Solving Time-Dependent Planning Problems |
SIGCSE
2010
ACM
14 years 2 months ago
2010
ACM
Using effective teaching practices is a high priority for educators. One important pedagogical skill for computer science instructors is asking effective questions. This paper pre...
CP
1998
Springer
14 years 2 days ago
1998
Springer
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
ESWA
2007
13 years 7 months ago
2007
The goal of assembly planning consists in generating feasible sequences to assemble a product and selecting an efficient assembly sequence from which related constraint factors su...
CONSTRAINTS
2010
13 years 5 months ago
2010
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
ICLP
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Reasoning about social networks (labeled, directed, weighted graphs) is becoming increasingly important and there are now models of how certain phenomena (e.g. adoption o...