Results 11  20
of
1,133
A simultaneous perturbation stochastic approximationbased ActorCritic . . .
, 2004
"... A twotimescale simulationbased actorcritic algorithm for solution of infinite horizon Markov decision processes with finite state and compact action spaces under the discounted cost criterion is proposed. The algorithm does gradient search on the slower timescale in the space of deterministic po ..."
Abstract

Cited by 54 (20 self)
 Add to MetaCart
A twotimescale simulationbased actorcritic algorithm for solution of infinite horizon Markov decision processes with finite state and compact action spaces under the discounted cost criterion is proposed. The algorithm does gradient search on the slower timescale in the space of deterministic
Migrating to optimal RBAC with minimal perturbation
 in Proceedings of the 13th ACM Symposium on Access Control Models and Technologies Proceedings SACMAT ’08. ACM
, 2008
"... Devising a complete and correct set of roles has been recognized as one of the most important and challenging tasks in implementing role based access control. A key problem related to this is the notion of goodness when is a set of roles good? Recently, the role mining problem (RMP) has been define ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
migration cost into account when defining optimality, which would allow us to come up with the best suited set of roles. In this paper, we define a fundamentally different Role Mining Problem that takes the problem of deployed roles into account. We define the Minimal Perturbation RMP as the problem
The guaranteed cost control problem of uncertain singularly perturbed systems
 J. Math. Anal. Appl
"... In this paper we study the algebraic Riccati equation corresponding to the guaranteed cost control theory for an uncertain singularly perturbed system. The construction of the controller involves solving the fullorder algebraic Riccati equation with small parameter ε. Under controloriented assum ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
In this paper we study the algebraic Riccati equation corresponding to the guaranteed cost control theory for an uncertain singularly perturbed system. The construction of the controller involves solving the fullorder algebraic Riccati equation with small parameter ε. Under control
Nonlinearized Perturbation Theories
, 1996
"... Abstract A brief review is presented of the two recent perturbation algorithms. Their common idea lies in a not quite usual treatment of linear Schrödinger equations via nonlinear mathematical means. The first approach (let us call it a quasiexact perturbation theory, QEPT) tries to get the very z ..."
Abstract
 Add to MetaCart
Abstract A brief review is presented of the two recent perturbation algorithms. Their common idea lies in a not quite usual treatment of linear Schrödinger equations via nonlinear mathematical means. The first approach (let us call it a quasiexact perturbation theory, QEPT) tries to get the very
Recognition of Shapes by Editing Shock Graphs
 In IEEE International Conference on Computer Vision
, 2001
"... This paper presents a novel recognition framework which is based on matching shock graphs of 2D shape outlines, where the distance between two shapes is defined to be the cost of the least action path deforming one shape to another. Three key ideas render the implementation of this framework practic ..."
Abstract

Cited by 125 (7 self)
 Add to MetaCart
This paper presents a novel recognition framework which is based on matching shock graphs of 2D shape outlines, where the distance between two shapes is defined to be the cost of the least action path deforming one shape to another. Three key ideas render the implementation of this framework
Perturbed Iterative Feedback Tuning
"... Optimal performance of process control requires a controller synthesis based on a performance criterion. In order to minimize the criterion, a model for the process is normally required. Iterative Feedback Tuning (IFT) is a data driven methodology to tune controller parameters given a performance c ..."
Abstract
 Add to MetaCart
few iterations. Plant experiments are costly and product produced meanwhile may have reduced
Stability of highorder perturbative methods for the computation of DirichletNeumann operators
 J. COMPUT. PHYS
, 2001
"... In this paper we present results on the stability of perturbation methods for the evaluation of Dirichlet–Neumann operators (DNO) defined on domains that are viewed as complex deformations of a basic, simple geometry. In such cases, geometric perturbation methods, based on variations of the spatial ..."
Abstract

Cited by 43 (24 self)
 Add to MetaCart
and the possibility of analytic continuation of the perturbation series. It can also be related to classical (preconditioned) spectral approaches and, as such, it retains, in finite arithmetic, the spectral convergence properties of classical perturbative methods, albeit at a higher computational cost (as it does
Search Spaces for MinPerturbation Repair
"... Abstract. Many problems require minimally perturbing an initial state in order to repair some violated constraints. We consider two search spaces for exactly solving this minimal perturbation repair problem: a standard, differencebased search space, and a new, commitmentbased search space. Empiric ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
. Empirical results with exact search algorithms for a mincost virtual machine reassignment problem, a minimal perturbation repair problem related to server consolidation in data centers, show that the commitmentbased search space can be significantly more efficient. 1
Perturbation Analyses for the Cholesky Downdating Problem
, 1996
"... New perturbation analyses are presented for the block Cholesky downdating problem U T U = R T R \Gamma X T X. These show how changes in R and X alter the Cholesky factor U . There are two main cases for the perturbation matrix \DeltaR in R: (1) \DeltaR is a general matrix; (2)\DeltaR is an up ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
R is an upper triangular matrix. For both cases, first order perturbation bounds for the downdated Cholesky factor U are given using two approaches  a detailed "matrixvector equation" analysis which provides tight bounds and resulting true condition numbers, which unfortunately are costly
Interference Alignment via Controlled Perturbations
"... Abstract—In this work, we study the socalled leakage minimization problem, within the context of interference alignment (IA). For that purpose, we propose a novel approach based on controlled perturbations of the leakage function, and show how the latter can be used as a mechanism to control the a ..."
Abstract
 Add to MetaCart
Abstract—In this work, we study the socalled leakage minimization problem, within the context of interference alignment (IA). For that purpose, we propose a novel approach based on controlled perturbations of the leakage function, and show how the latter can be used as a mechanism to control
Results 11  20
of
1,133