Sciweavers

2343 search results - page 97 / 469
» Structure and Interpretation of Computer Programs
Sort
View
AAAI
1996
15 years 6 months ago
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
Craig Boutilier, David Poole
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
15 years 3 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
PPSN
2004
Springer
15 years 10 months ago
Learning Probabilistic Tree Grammars for Genetic Programming
Genetic Programming (GP) provides evolutionary methods for problems with tree representations. A recent development in Genetic Algorithms (GAs) has led to principled algorithms cal...
Peter A. N. Bosman, Edwin D. de Jong
KI
2008
Springer
15 years 4 months ago
A Framework for Mobile Intention Recognition in Spatially Structured Environments
Abstract. Mobile intention recognition is the problem of inferring an agent's intentions from the spatio-temporal behavior she shows. We present a framework for mobile intenti...
Peter Kiefer, Klaus Stein
147
Voted
ACMSE
2009
ACM
15 years 8 months ago
Using computer graphics to explore object oriented concepts using C
Most recent graphics courses are what we would call topdown courses. Courses that focus on using graphical packages to implement and teach graphics. The course discussed in this p...
William C. Kreahling