Results 1  10
of
16,261
Stable Function Approximation in Dynamic Programming
 IN MACHINE LEARNING: PROCEEDINGS OF THE TWELFTH INTERNATIONAL CONFERENCE
, 1995
"... The success of reinforcement learning in practical problems depends on the ability tocombine function approximation with temporal difference methods such as value iteration. Experiments in this area have produced mixed results; there have been both notable successes and notable disappointments. Theo ..."
Abstract

Cited by 263 (6 self)
 Add to MetaCart
The success of reinforcement learning in practical problems depends on the ability tocombine function approximation with temporal difference methods such as value iteration. Experiments in this area have produced mixed results; there have been both notable successes and notable disappointments
Proposed NIST Standard for RoleBased Access Control
, 2001
"... In this article we propose a standard for rolebased access control (RBAC). Although RBAC models have received broad support as a generalized approach to access control, and are well recognized for their many advantages in performing largescale authorization management, no single authoritative def ..."
Abstract

Cited by 544 (13 self)
 Add to MetaCart
on defining a fundamental and stable set of RBAC components. This standard is organized into the RBAC Reference Model and the RBAC System and Administrative Functional Specification. The reference model defines the scope of features that comprise the standard and provides a consistent vocabulary in support
Excitatory and inhibitory interactions in localized populations of model
 Biophysics
, 1972
"... ABSMAcr Coupled nonlinear differential equations are derived for the dynamics of spatially localized populations containing both excitatory and inhibitory model neurons. Phase plane methods and numerical solutions are then used to investigate population responses to various types of stimuli. The res ..."
Abstract

Cited by 495 (11 self)
 Add to MetaCart
. The results obtained show simple and multiple hysteresis phenomena and limit cycle activity. The latter is particularly interesting since the frequency ofthe limit cycle oscillationis found to be a monotonic function of stimulus intensity. Finally, it is proved that the existence of limit cycle dynamics
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
 SIAM Journal on Optimization
, 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract

Cited by 547 (12 self)
 Add to MetaCart
We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized
The irreducibility of the space of curves of given genus
 Publ. Math. IHES
, 1969
"... Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k ~ ..."
Abstract

Cited by 506 (2 self)
 Add to MetaCart
strengthened his method so that it applies in all characteristics (SGA 7, ~968) 9 Mumford has also given a proof using theta functions in char. ~2. The result is this: Stable Reduction Theorem. Let R be a discrete valuation ring with quotient field K. Let A be an abelian variety over K. Then there exists a
Extending and Implementing the Stable Model Semantics
, 2002
"... A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by providing optimization capabilities ..."
Abstract

Cited by 396 (9 self)
 Add to MetaCart
and functions and compiles general weight constraint rules to basic constraint rules. A major part of the work is the development of an ecient search procedure for computing stable models for this kernel language. The procedure is compared with and empirically tested against satis ability checkers
A Note on Maximal Stable Functions
"... This note studies maximal elements in dIdomains, especially maximal stable functions. First, a sufficient condition for a stable function to be maximal is provided. The condition requires that the function be total, in the sense that it preserves maximal elements. Examples are then given to demonst ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This note studies maximal elements in dIdomains, especially maximal stable functions. First, a sufficient condition for a stable function to be maximal is provided. The condition requires that the function be total, in the sense that it preserves maximal elements. Examples are then given
Sequential algorithms and strongly stable functions
 in the Linear Summer School, Azores
, 2003
"... ..."
Introduction Stone Duality for Stable Functions
, 1991
"... The problem of finding an algebraic structure for stable open subsets of a suitable domain has been ..."
Abstract
 Add to MetaCart
The problem of finding an algebraic structure for stable open subsets of a suitable domain has been
Maximality and Totality of Stable Functions in the Category of Stable Bifinite Domains ∗
"... This paper studies maximality and totality of stable functions in the category of stable bifinite domains. We present three main results: (1) every maximumpreserving function is a maximal element in the stable function spaces; (2) a maximal stable function f: D → E is maximumpreserving if D is maxi ..."
Abstract
 Add to MetaCart
This paper studies maximality and totality of stable functions in the category of stable bifinite domains. We present three main results: (1) every maximumpreserving function is a maximal element in the stable function spaces; (2) a maximal stable function f: D → E is maximumpreserving if D
Results 1  10
of
16,261