Results 1  10
of
262
Stochastic Superoptimization
"... We formulate the loopfree binary superoptimization task as a stochastic search problem. The competing constraints of transformation correctness and performance improvement are encoded as terms in a cost function, and a Markov Chain Monte Carlo sampler is used to rapidly explore the space of all pos ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
We formulate the loopfree binary superoptimization task as a stochastic search problem. The competing constraints of transformation correctness and performance improvement are encoded as terms in a cost function, and a Markov Chain Monte Carlo sampler is used to rapidly explore the space of all
Stochastic superoptimization
, 2013
"... We formulate the loopfree, binary superoptimization task as a stochastic search problem. The competing constraints of transformation correctness and performance improvement are encoded as terms in a cost function, and a Markov Chain Monte Carlo sampler is used to rapidly explore the space of all po ..."
Abstract
 Add to MetaCart
We formulate the loopfree, binary superoptimization task as a stochastic search problem. The competing constraints of transformation correctness and performance improvement are encoded as terms in a cost function, and a Markov Chain Monte Carlo sampler is used to rapidly explore the space of all
Superoptimization of Memory Subsystems ∗
"... The disparity in performance between processors and main memories has led computer architects to incorporate large cache hierarchies in modern computers. Because these cache hierarchies are designed to be generalpurpose, they may not provide the best possible performance for a given application. ..."
Abstract
 Add to MetaCart
. In this paper, we determine a memory subsystem well suited for a given application and main memory by discovering a memory subsystem comprised of caches, scratchpads, and other components that are combined to provide better performance. We draw motivation from the superoptimization of instruction sequences
Fast superoptimal preconditioning of multiindex Toeplitz matrices
, 2006
"... In this article three wellknown methods of circulant preconditioning of finite multiindex Toeplitz linear systems, that is linear systems indexed by integers i1,...,id with 0 � is <ns (s = 1,...,d), are studied in detail. A general algorithm for the construction of the socalled superoptimal p ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
In this article three wellknown methods of circulant preconditioning of finite multiindex Toeplitz linear systems, that is linear systems indexed by integers i1,...,id with 0 � is <ns (s = 1,...,d), are studied in detail. A general algorithm for the construction of the socalled superoptimal
Lyapunov stabilizability of controlled diffusions via a superoptimality principle for viscosity solutions
"... We prove optimality principles for semicontinuous bounded viscosity solutions of HamiltonJacobiBellman equations. In particular we provide a representation formula for viscosity supersolutions as value functions of suitable obstacle control problems. This result is applied to extend the Lyapunov d ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
illustrate the theory with some examples. Key words. Controlled degenerate diffusion, HamiltonJacobiBellman inequalities, viscosity solutions, dynamic programming, superoptimality principles, obstacle problem, stochastic control, stability in probability, asymptotic stability. AMS subject classification
Superoptimal rate of convergence in nonparametric estimation for functional valued processes.
, 2013
"... In this paper, we consider the nonparametric estimation of the generalised regression function for continuous time processes with irregular paths when the regressor takes values in a semimetric space. We establish the meansquare convergence of our estimator with the same superoptimal rate as whe ..."
Abstract
 Add to MetaCart
In this paper, we consider the nonparametric estimation of the generalised regression function for continuous time processes with irregular paths when the regressor takes values in a semimetric space. We establish the meansquare convergence of our estimator with the same superoptimal rate
Sub and superoptimality principles and construction of almost optimal strategies for differential games in Hilbert spaces
"... We prove sub and superoptimality principles of dynamic programming and show how to use the theory of viscosity solutions to construct almost optimal strategies for twoplayer, zerosum differential games driven by abstract evolution equations in Hilbert spaces. ..."
Abstract
 Add to MetaCart
We prove sub and superoptimality principles of dynamic programming and show how to use the theory of viscosity solutions to construct almost optimal strategies for twoplayer, zerosum differential games driven by abstract evolution equations in Hilbert spaces.
Conjugate Gradient Methods for Toeplitz Systems
 SIAM Review
, 1996
"... In this expository paper, we survey some of the latest developments on using preconditioned conjugate gradient methods for solving Toeplitz systems. One of the main results is that the complexity of solving a large class of nbyn Toeplitz systems is reduced to O(n log n) operations as compared to O ..."
Abstract

Cited by 174 (40 self)
 Add to MetaCart
In this expository paper, we survey some of the latest developments on using preconditioned conjugate gradient methods for solving Toeplitz systems. One of the main results is that the complexity of solving a large class of nbyn Toeplitz systems is reduced to O(n log n) operations as compared to O(n log 2 n) operations required by fast direct Toeplitz solvers. Different preconditioners proposed for Toeplitz systems are reviewed. Applications to Toeplitzrelated systems arising from partial differential equations, queueing networks, signal and image processing, integral equations, and time series analysis are given. Key words. Toeplitz matrices, preconditioners, preconditioned conjugate gradient methods, differential equations, signal and image processing, time series, queueing problems, integral equations. AMS Subject classifications. 45E10, 62M10, 65F10, 65N22, 65P05, 68U10, 93E11 Department of Mathematics, The Chinese University of Hong Kong, Shatin, Hong Kong. Research suppo...
unknown title
, 2004
"... Lyapunov stabilizability of controlled diffusions via a superoptimality principle for viscosity solutions ∗ ..."
Abstract
 Add to MetaCart
Lyapunov stabilizability of controlled diffusions via a superoptimality principle for viscosity solutions ∗
unknown title
, 2005
"... Lyapunov stabilizability of controlled diffusions via a superoptimality principle for viscosity solutions ∗ ..."
Abstract
 Add to MetaCart
Lyapunov stabilizability of controlled diffusions via a superoptimality principle for viscosity solutions ∗
Results 1  10
of
262