Sciweavers

13784 search results - page 434 / 2757
» On Computing Functions with Uncertainty
Sort
View
DATE
1998
IEEE
100views Hardware» more  DATE 1998»
15 years 11 months ago
Combinational Verification based on High-Level Functional Specifications
We present a new combinational verification technique where the functional specification of a circuit under verification is utilized to simplify the verification task. The main id...
Evguenii I. Goldberg, Yuji Kukimoto, Robert K. Bra...
AAAI
2007
15 years 9 months ago
Compact Spectral Bases for Value Function Approximation Using Kronecker Factorization
A new spectral approach to value function approximation has recently been proposed to automatically construct basis functions from samples. Global basis functions called proto-val...
Jeffrey Johns, Sridhar Mahadevan, Chang Wang
SIAMSC
2008
191views more  SIAMSC 2008»
15 years 6 months ago
ORBIT: Optimization by Radial Basis Function Interpolation in Trust-Regions
Abstract. We present a new derivative-free algorithm, ORBIT, for unconstrained local optimization of computationally expensive functions. A trust-region framework using interpolati...
Stefan M. Wild, Rommel G. Regis, Christine A. Shoe...
AIPS
2007
15 years 9 months ago
Learning to Plan Using Harmonic Analysis of Diffusion Models
This paper summarizes research on a new emerging framework for learning to plan using the Markov decision process model (MDP). In this paradigm, two approaches to learning to plan...
Sridhar Mahadevan, Sarah Osentoski, Jeffrey Johns,...
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
15 years 10 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson