Results 1 - 10
of
3,348
A capacity theory of comprehension: Individual differences in working memory
- Psychological Review
, 1992
"... A theory of the way working memory capacity constrains comprehension is proposed. The theory proposes that both processing and storage are mediated by activation and that the total amount of activation available in working memory varies among individuals. Individual differences in working memory cap ..."
Abstract
-
Cited by 700 (21 self)
- Add to MetaCart
that their syntactic processes are not informationally encapsulated. Another aspect is syntactic ambiguity: The larger capacity of some individuals permits them to maintain multiple interpretations. The theory is instantiated as a production system model in which the amount of activation available to the model affects
A Conceptual Framework and a Toolkit for Supporting the Rapid Prototyping of Context-Aware Applications
, 2001
"... Computing devices and applications are now used beyond the desktop, in diverse environments, and this trend toward ubiquitous computing is accelerating. One challenge that remains in this emerging research field is the ability to enhance the behavior of any application by informing it of the context ..."
Abstract
-
Cited by 906 (28 self)
- Add to MetaCart
removed from that vision. This is due to three main problems: (1) the notion of context is still ill defined; (2) there is a lack of conceptual models and methods to help drive the design of context-aware applications; and (3) no tools are available to jump-start the development of context
Mixed membership stochastic block models for relational data with application to protein-protein interactions
- In Proceedings of the International Biometrics Society Annual Meeting
, 2006
"... We develop a model for examining data that consists of pairwise measurements, for example, presence or absence of links between pairs of objects. Examples include protein interactions and gene regulatory networks, collections of author-recipient email, and social networks. Analyzing such data with p ..."
Abstract
-
Cited by 378 (52 self)
- Add to MetaCart
of connectivity (blockmodel) and a local model to instantiate nodespecific variability in the connections (mixed membership). We develop a general variational inference algorithm for fast approximate posterior inference. We demonstrate the advantages of mixed membership stochastic blockmodels with applications
Agents that reason and negotiate by arguing
- Journal of Logic and Computation
, 1998
"... The need for negotiation in multi-agent systems stems from the requirement for agents to solve the problems posed by their interdependence upon one another. Negotiation provides a solution to these problems by giving the agents the means to resolve their conflicting objectives, correct inconsistenci ..."
Abstract
-
Cited by 381 (77 self)
- Add to MetaCart
. The framework provides a formal model of argumentation-based reasoning and negotiation, details a design philosophy which ensures a clear link between the formal model and its practical instantiation, and describes a case study of this relationship for a particular class of architectures (namely those
Process Instantiation
- Data & Knowledge Engineering
"... Although several process modeling languages allow one to specify processes with multiple start elements, the precise semantics of such models are often unclear, both from a pragmatic and from a theoretical point of view. This paper addresses the lack of research on this problem and introduces the CA ..."
Abstract
-
Cited by 12 (7 self)
- Add to MetaCart
the CASU framework (from Creation, Activation, Subscription, Unsubscription). The contribution of this framework is a systematic description of design alternatives for the specification of instantiation semantics of process modeling languages. We classify six prominent languages by the help
Deep instantiation
"... ding software engineering, is to minimize the amount of accidental complexity which is introduced into engineering solutions due to mismatches between a problem and the technology used to represent the problem. As model-driven development moves to the center stage of software engi-neering, it is par ..."
Abstract
- Add to MetaCart
ding software engineering, is to minimize the amount of accidental complexity which is introduced into engineering solutions due to mismatches between a problem and the technology used to represent the problem. As model-driven development moves to the center stage of software engi
Instantiation Semantics for Process Models
- In: Proceedings of the 6th International Conference on Business Process Management (BPM), LNCS 2008, S
"... Abstract. Although several process modeling languages allow one to specify processes with multiple start elements, the precise semantics of such models are often unclear, both from a pragmatic and from a theoretical point of view. This paper addresses the lack of research on this problem and introdu ..."
Abstract
-
Cited by 8 (4 self)
- Add to MetaCart
and introduces the CASU framework. The contribution of this framework is a systematic description of design alternatives for the specification of instantiation semantics of process modeling languages. We classify six of the most prominent languages by the help of this framework. Our work provides the basis
Modelling Entity Instantiations
"... We introduce the problem of detecting Entity Instantiations, a type of entity relation in which a set of entities is introduced, and either a member or subset of this set is mentioned afterwards. We perform the first, reliable, corpus study of Entity Instantiations, concentrating on intersentential ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
We introduce the problem of detecting Entity Instantiations, a type of entity relation in which a set of entities is introduced, and either a member or subset of this set is mentioned afterwards. We perform the first, reliable, corpus study of Entity Instantiations, concentrating on intersentential
Scaling Clustering Algorithms to Large Databases”, Microsoft Research Report:
, 1998
"... Abstract Practical clustering algorithms require multiple data scans to achieve convergence. For large databases, these scans become prohibitively expensive. We present a scalable clustering framework applicable to a wide class of iterative clustering. We require at most one scan of the database. I ..."
Abstract
-
Cited by 304 (5 self)
- Add to MetaCart
. In this work, the framework is instantiated and numerically justified with the popular K-Means clustering algorithm. The method is based on identifying regions of the data that are compressible, regions that must be maintained in memory, and regions that are discardable. The algorithm operates within
Models, Simulations, Instantiations, and Evidence: . . .
- JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE
, 2007
"... ..."
Results 1 - 10
of
3,348