• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 1,320,598
Next 10 →

Cognitive load during problem solving: effects on learning

by John Sweller - COGNITIVE SCIENCE , 1988
"... Considerable evidence indicates that domain specific knowledge in the form of schemes is the primary factor distinguishing experts from novices in problem-solving skill. Evidence that conventional problem-solving activity is not effective in schema acquisition is also accumulating. It is suggested t ..."
Abstract - Cited by 603 (13 self) - Add to MetaCart
Considerable evidence indicates that domain specific knowledge in the form of schemes is the primary factor distinguishing experts from novices in problem-solving skill. Evidence that conventional problem-solving activity is not effective in schema acquisition is also accumulating. It is suggested

Knowledge representations, reasoning and declarative problem solving . . .

by Chitta Baral , 2001
"... ..."
Abstract - Cited by 714 (43 self) - Add to MetaCart
Abstract not found

A solution to Plato’s problem: The latent semantic analysis theory of acquisition, induction, and representation of knowledge

by Thomas K Landauer, Susan T. Dutnais - PSYCHOLOGICAL REVIEW , 1997
"... How do people know as much as they do with as little information as they get? The problem takes many forms; learning vocabulary from text is an especially dramatic and convenient case for research. A new general theory of acquired similarity and knowledge representation, latent semantic analysis (LS ..."
Abstract - Cited by 1772 (10 self) - Add to MetaCart
How do people know as much as they do with as little information as they get? The problem takes many forms; learning vocabulary from text is an especially dramatic and convenient case for research. A new general theory of acquired similarity and knowledge representation, latent semantic analysis

Risk and protective factors for alcohol and other drug problems in adolescence and early adulthood: Implications for substance abuse prevention

by J. David Hawkins, Richard E Catalano, Janet Y Miller - Psychological Bulletin , 1992
"... The authors suggest that the most promising route to effective strategies for the prevention of adolescent alcohol and other drug problems is through a risk-focused approach. This approach requires the identification of risk factors for drug abuse, identification of methods by which risk factors hav ..."
Abstract - Cited by 693 (18 self) - Add to MetaCart
The authors suggest that the most promising route to effective strategies for the prevention of adolescent alcohol and other drug problems is through a risk-focused approach. This approach requires the identification of risk factors for drug abuse, identification of methods by which risk factors

On the Criteria To Be Used in Decomposing Systems into Modules

by D. L. Parnas - Communications of the ACM , 1972
"... This paper discusses modularization as a mechanism for improving the flexibility and comprehensibility of a system while allowing the shortening of its development time. The effectiveness of a “modularization ” is dependent upon the criteria used in dividing the system into modules. A system design ..."
Abstract - Cited by 1572 (16 self) - Add to MetaCart
problem is presented and both a conventional and unconventional decomposition are described. It is shown that the unconventional decompositions have distinct advantages for the goals outlined. The criteria used in arriving at the decompositions are discussed. The unconventional decomposition

Genetic Algorithms for Multiobjective Optimization: Formulation, Discussion and Generalization

by Carlos M. Fonseca, Peter J. Fleming , 1993
"... The paper describes a rank-based fitness assignment method for Multiple Objective Genetic Algorithms (MOGAs). Conventional niche formation methods are extended to this class of multimodal problems and theory for setting the niche size is presented. The fitness assignment method is then modified to a ..."
Abstract - Cited by 610 (15 self) - Add to MetaCart
The paper describes a rank-based fitness assignment method for Multiple Objective Genetic Algorithms (MOGAs). Conventional niche formation methods are extended to this class of multimodal problems and theory for setting the niche size is presented. The fitness assignment method is then modified

Space/Time Trade-offs in Hash Coding with Allowable Errors

by Burton H. Bloom - Communications of the ACM , 1970
"... this paper trade-offs among certain computational factors in hash coding are analyzed. The paradigm problem considered is that of testing a series of messages one-by-one for membership in a given set of messages. Two new hash- coding methods are examined and compared with a particular conventional h ..."
Abstract - Cited by 2067 (0 self) - Add to MetaCart
this paper trade-offs among certain computational factors in hash coding are analyzed. The paradigm problem considered is that of testing a series of messages one-by-one for membership in a given set of messages. Two new hash- coding methods are examined and compared with a particular conventional

Learning to predict by the methods of temporal differences

by Richard S. Sutton - MACHINE LEARNING , 1988
"... This article introduces a class of incremental learning procedures specialized for prediction – that is, for using past experience with an incompletely known system to predict its future behavior. Whereas conventional prediction-learning methods assign credit by means of the difference between predi ..."
Abstract - Cited by 1501 (56 self) - Add to MetaCart
, they have remained poorly understood. Here we prove their convergence and optimality for special cases and relate them to supervised-learning methods. For most real-world prediction problems, temporal-difference methods require less memory and less peak computation than conventional methods and they produce

Transactional Memory: Architectural Support for Lock-Free Data Structures

by Maurice Herlihy, J. Eliot B. Moss
"... A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be prevented from operating on that object. In highly concurrent systems, lock-free data structures avoid common problems asso ..."
Abstract - Cited by 1006 (24 self) - Add to MetaCart
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be prevented from operating on that object. In highly concurrent systems, lock-free data structures avoid common problems

Parametric Shape Analysis via 3-Valued Logic

by Mooly Sagiv, Thomas Reps, Reinhard Wilhelm , 2001
"... Shape Analysis concerns the problem of determining "shape invariants"... ..."
Abstract - Cited by 660 (79 self) - Add to MetaCart
Shape Analysis concerns the problem of determining "shape invariants"...
Next 10 →
Results 1 - 10 of 1,320,598
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University