Sciweavers

1090 search results - page 80 / 218
» Type-Directed Partial Evaluation
Sort
View
ASE
1998
81views more  ASE 1998»
13 years 7 months ago
Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
Steven G. Woods, Qiang Yang
AI
1999
Springer
13 years 7 months ago
Using Grice's maxim of Quantity to select the content of plan descriptions
Intelligent systems are often called upon to form plans that direct their own or other agents' activities. For these systems, the ability to describe plans to people in natur...
R. Michael Young
CORR
1998
Springer
135views Education» more  CORR 1998»
13 years 7 months ago
The Computational Complexity of Probabilistic Planning
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
Michael L. Littman, Judy Goldsmith, Martin Mundhen...
GIS
1998
ACM
13 years 7 months ago
Accuracy of Local Topographic Variables Derived from Digital Elevation Models
We study the accuracy of data on some local topographic attributes derived from digital elevation models (DEMs). First, we carry out a test for the precision of four methods for ca...
Igor v. Florinsky
SP
2002
IEEE
128views Security Privacy» more  SP 2002»
13 years 7 months ago
Fitting hidden Markov models to psychological data
Markov models have been used extensively in psychology of learning. Applications of hidden Markov models are rare however. This is partially due to the fact that comprehensive stat...
Ingmar Visser, Maartje E. J. Raijmakers, Peter C. ...