Results 1 - 10 of 25,511

Simplification by cooperating decision procedures

by Greg Nelson, Derek C. Oppen - ACM Transactions on Programming Languages and Systems , 1979
"... A method for combining decision procedures for several theories into a single decision procedure for their combination is described, and a simplifier based on this method is discussed. The simplifier finds a normal form for any expression formed from individual variables, the usual Boolean connectiv ..."
Abstract - Cited by 455 (2 self) - Add to MetaCart
A method for combining decision procedures for several theories into a single decision procedure for their combination is described, and a simplifier based on this method is discussed. The simplifier finds a normal form for any expression formed from individual variables, the usual Boolean

Toward an instance theory of automatization

by Gordon D. Logan - Psychological Review , 1988
"... This article presents a theory in which automatization is construed as the acquisition of a domain-specific knowledge base, formed of separate representations, instances, of each exposure to the task. Processing is considered automatic if it relies on retrieval of stored instances, which will occur ..."
Abstract - Cited by 647 (38 self) - Add to MetaCart
; Harter, 1899). Skills are thought to consist largely of collections of automatic processes and procedures

Implementing remote procedure calls

by Andrew D. Birrell, Bruce Jay Nelson - ACM Transactions on Computer Systems , 1984
"... Remote procedure calls (RPC) appear to be a useful paradig m for providing communication across a network between programs written in a high-level language. This paper describes a package providing a remote procedure call facility, the options that face the designer of such a package, and the decisi ..."
Abstract - Cited by 1059 (5 self) - Add to MetaCart
Remote procedure calls (RPC) appear to be a useful paradig m for providing communication across a network between programs written in a high-level language. This paper describes a package providing a remote procedure call facility, the options that face the designer of such a package

Term-weighting approaches in automatic text retrieval

by Gerard Salton, Christopher Buckley - INFORMATION PROCESSING AND MANAGEMENT , 1988
"... The experimental evidence accumulated over the past 20 years indicates that text indexing systems based on the assignment of appropriately weighted single terms produce retrieval results that are superior to those obtainable with other more elaborate text representations. These results depend crucia ..."
Abstract - Cited by 2189 (10 self) - Add to MetaCart
crucially on the choice of effective term-weighting systems. This article summarizes the insights gained in automatic term weighting, and provides baseline single-term-indexing models with which other more elaborate content analysis procedures can be compared.

Automatic verification of finite-state concurrent systems using temporal logic specifications

by E. M. Clarke, E. A. Emerson, A. P. Sistla - ACM Transactions on Programming Languages and Systems , 1986
"... We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a (propositional, branching-time) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract - Cited by 1388 (62 self) - Add to MetaCart
We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a (propositional, branching-time) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent

Automaticity of social behavior: Direct effects of trait construct and stereotype activation on action

by John A. Bargh, Mark Chen, Lara Burrows - Journal of Personality and Social Psychology , 1996
"... Previous research has shown that trait concepts and stereotypes become active automatically in the presence of relevant behavior or stereotyped-group features. Through the use of the same priming procedures as in previous impression formation research, Experiment l showed that participants whose con ..."
Abstract - Cited by 584 (18 self) - Add to MetaCart
Previous research has shown that trait concepts and stereotypes become active automatically in the presence of relevant behavior or stereotyped-group features. Through the use of the same priming procedures as in previous impression formation research, Experiment l showed that participants whose

Symbolic Model Checking: 10^20 States and Beyond

by J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, L. J. Hwang , 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining state-graph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract - Cited by 758 (41 self) - Add to MetaCart
Many different methods have been devised for automatically verifying finite state systems by examining state-graph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number

A training algorithm for optimal margin classifiers

by Bernhard E. Boser, et al. - PROCEEDINGS OF THE 5TH ANNUAL ACM WORKSHOP ON COMPUTATIONAL LEARNING THEORY , 1992
"... A training algorithm that maximizes the margin between the training patterns and the decision boundary is presented. The technique is applicable to a wide variety of classifiaction functions, including Perceptrons, polynomials, and Radial Basis Functions. The effective number of parameters is adjust ..."
Abstract - Cited by 1865 (43 self) - Add to MetaCart
is adjusted automatically to match the complexity of the problem. The solution is expressed as a linear combination of supporting patterns. These are the subset of training patterns that are closest to the decision boundary. Bounds on the generalization performance based on the leave-one-out method and the VC

Symbolic Model Checking without BDDs

by Armin Biere , Alessandro Cimatti, Edmund Clarke, Yunshan Zhu , 1999
"... Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis ..."
Abstract - Cited by 917 (75 self) - Add to MetaCart
Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis

Wrapper Induction for Information Extraction

by Nicholas Kushmerick , 1997
"... The Internet presents numerous sources of useful information---telephone directories, product catalogs, stock quotes, weather forecasts, etc. Recently, many systems have been built that automatically gather and manipulate such information on a user's behalf. However, these resources are usually ..."
Abstract - Cited by 624 (30 self) - Add to MetaCart
The Internet presents numerous sources of useful information---telephone directories, product catalogs, stock quotes, weather forecasts, etc. Recently, many systems have been built that automatically gather and manipulate such information on a user's behalf. However, these resources
Results 1 - 10 of 25,511