Results 1  10
of
3,207
Classification in the KLONE knowledge representation system
 COGNITIVE SCIENCE
, 1985
"... KLONE lets one define and use a class of descriptive terms called Concepts, where each Concept denotes a set of objects A subsumption relation between Concepts is defined which is related to set inclusion by way of a semantics for Concepts. This subsumption relation defines a partial order on Conce ..."
Abstract

Cited by 673 (8 self)
 Add to MetaCart
KLONE lets one define and use a class of descriptive terms called Concepts, where each Concept denotes a set of objects A subsumption relation between Concepts is defined which is related to set inclusion by way of a semantics for Concepts. This subsumption relation defines a partial order
An argument for basic emotions
 Cognition and Emotion
, 1992
"... Ortony and Turner's (1990) arguments against those who adopt the view that there are basic emotions are challenged. The evidence on universals in expression and in physiology strongly sug~ests that ~he~e is a biological basis to the emotions that have been studied. Ortony and Turner's revi ..."
Abstract

Cited by 1022 (6 self)
 Add to MetaCart
's reviews of thls hterature are faulted, and their alternative theoretical explanations do not fit the evidence. The utility of the basic emotions approach is also shown in terms of the research it has generated. In their argument against basic emotions. Ortony and Turner (990) distinguished two ways
Policy gradient methods for reinforcement learning with function approximation.
 In NIPS,
, 1999
"... Abstract Function approximation is essential to reinforcement learning, but the standard approach of approximating a value function and determining a policy from it has so far proven theoretically intractable. In this paper we explore an alternative approach in which the policy is explicitly repres ..."
Abstract

Cited by 439 (20 self)
 Add to MetaCart
output is action selection probabilities, and whose weights are the policy parameters. Let θ denote the vector of policy parameters and ρ the performance of the corresponding policy (e.g., the average reward per step). Then, in the policy gradient approach, the policy parameters are updated approximately
Submodular functions, matroids and certain polyhedra
, 2003
"... The viewpoint of the subject of matroids, and related areas of lattice theory, has always been, in one way or another, abstraction of algebraic dependence or, equivalently, abstraction of the incidence relations in geometric representations of algebra. Often one of the main derived facts is that all ..."
Abstract

Cited by 355 (0 self)
 Add to MetaCart
The viewpoint of the subject of matroids, and related areas of lattice theory, has always been, in one way or another, abstraction of algebraic dependence or, equivalently, abstraction of the incidence relations in geometric representations of algebra. Often one of the main derived facts
Ontologies and knowledge bases: Towards a terminological clarification
 Towards very Large Knowledge bases: Knowledge Building and Knowledge sharing
, 1995
"... The word “ontology ” has recently gained a good popularity within the knowledge engineering community. However, its meaning tends to remain a bit vague, as the term is used in very different ways. Limiting our attention to the various proposals made in the current debate in AI, we isolate a number o ..."
Abstract

Cited by 310 (13 self)
 Add to MetaCart
The word “ontology ” has recently gained a good popularity within the knowledge engineering community. However, its meaning tends to remain a bit vague, as the term is used in very different ways. Limiting our attention to the various proposals made in the current debate in AI, we isolate a number
Computable values; Denotable values;
, 2012
"... They depend on the characteristics of the used language Data Types: Collections of values that are homogeneous in respect of the operations that can be applied on them Distinctive features are the allowed operations that obviously, depend on the used language Types: Categorization Structures that cl ..."
Abstract
 Add to MetaCart
that classify uniquely (all) the structures that occur in a program They highlight the use (from the behavioral viewpoint) of each program structure They may mark each program structure in a way that is useful to investigate static properties of the program Example The program below is considered a correct
On finding the maxima of a set of vectors
 Journal of the ACM
, 1975
"... ASSTRACT. Let U1, U2,..., Ud be totally ordered sets and let V be a set of n ddimensional vectors In U ~ X Us.. X Ud. A partial ordering is defined on V in a natural way The problem of finding all maximal elements of V with respect to the partial ordering ~s considered The computational complexity ..."
Abstract

Cited by 230 (2 self)
 Add to MetaCart
ASSTRACT. Let U1, U2,..., Ud be totally ordered sets and let V be a set of n ddimensional vectors In U ~ X Us.. X Ud. A partial ordering is defined on V in a natural way The problem of finding all maximal elements of V with respect to the partial ordering ~s considered The computational com
Struggle  The First Denotational Game
 Proceedings of EuroPaL'90
, 1990
"... Games are often complex enough that new winning strategies cannot be devised without a clear and precise knowledge of the rules of the game. This situation makes games candidate to clear specifications and denotational semantics an interesting framework to specify games. This paper introduces a new ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Games are often complex enough that new winning strategies cannot be devised without a clear and precise knowledge of the rules of the game. This situation makes games candidate to clear specifications and denotational semantics an interesting framework to specify games. This paper introduces a new
LET US denote by
"... Abstract—In independent component analysis (ICA), when using the oneunit contrast function optimization approach to estimate independent components one by one, the constraint of uncorrelatedness between independent components prevents the algorithm from converging to the previously found components ..."
Abstract
 Add to MetaCart
components. A popular way to achieve uncorrelatedness is the Gram–Schmidtlike decorrelation scheme. In fact, uncorrelatedness between independent components can be achieved by reducing the degree of freedom in the unknown parameter set of the demixing matrix. In this letter, we propose to exploit
Results 1  10
of
3,207