Sciweavers

8949 search results - page 1562 / 1790
» is 1998
Sort
View
CORR
1998
Springer
82views Education» more  CORR 1998»
15 years 6 months ago
Tractability of Theory Patching
In this paper we consider the problem of theory patching, in which we are given a domain theory, some of whose components are indicated to be possibly awed, and a set of labeled t...
Shlomo Argamon-Engelson, Moshe Koppel
CORR
1998
Springer
135views Education» more  CORR 1998»
15 years 6 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...
CORR
1998
Springer
103views Education» more  CORR 1998»
15 years 6 months ago
The descriptive complexity approach to LOGCFL
Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclass...
Clemens Lautemann, Pierre McKenzie, Thomas Schwent...
159
Voted
CORR
1998
Springer
82views Education» more  CORR 1998»
15 years 6 months ago
Name Strategy: Its Existence and Implications
It is argued that colour name strategy, object name strategy, and chunking strategy in memory are all aspects of the same general phenomena, called stereotyping, and this in turn ...
Mark D. Roberts
CORR
1998
Springer
135views Education» more  CORR 1998»
15 years 6 months ago
The Design of EzWindows: A Graphics API for an Introductory Programming Course
Teaching object-oriented programming in an introductory programming course poses considerable challenges to the instructor. An often advocated approach to meeting this challenge i...
Bruce R. Childers, James P. Cohoon, Jack W. Davids...
« Prev « First page 1562 / 1790 Last » Next »