«approximation technique»
۶۷٬۸۷۹ نتیجهEnergy-Aware Sparse Approximation Technique (EAST) for Rechargeable Wireless Sensor Networks
Due to non-homogeneous spread of sunlight, sensing nodes typically have non-uniform energy profiles in rechargeable Wireless Sensor Networks (WSNs). An energy-aware work load distribution is therefore necessary for good data accuracy while ensuring an energy-neutral operation. Re
Multiscale Computational Strategy With Time and Space Homogenization: A Radial-Type Approximation Technique for Solving Microproblems
A new multiscale computational strategy for the analysis of structures (such as composite structures) described in detail both in space and in time was introduced recently. This strategy is iterative and involves an automatic homogenization procedure in space as well as in time.
On some difficulties with a posterior probability approximation technique
In Scott (2002) and Congdon (2006), a new method is advanced to compute posterior probabilities of models under consideration. It is based solely on MCMC outputs restricted to single models, i.e., it is bypassing reversible jump and other model exploration techniques. While it is
Practical Linear Value-approximation Techniques for First-order MDPs
Recent work on approximate linear programming (ALP) techniques for first-order Markov Decision Processes (FOMDPs) represents the value function linearly w.r.t. a set of first-order basis functions and uses linear programming techniques to determine suitable weights. This approach
Stochastic Approximation Techniques Applied to Parameter Estimation in a Biological Model
Simultaneous perturbation stochastic approximation (SPSA) is a class of optimization algorithms which compute an approximation of the gradient and/or the Hessian of the objective function by varying all the elements of the parameter vector simultaneously and therefore, require on
Approximation Techniques to Enable Dimensionality Reduction for Voronoi-Based Nearest Neighbor Search
Utilizing spatial index structures on secondary memory for nearest neighbor search in high-dimensional data spaces has been the subject of much research. With the potential to host larger indexes in main memory, applications demanding a high query throughput stand to benefit from
Association of Under-Approximation Techniques for Generating Tests from Models
In this paper we present a Model-Based Testing approach with which we generate tests from an abstraction of a source behavioural model. We show a new algorithm that computes the abstraction as an under-approximation of the source model. Our first contribution is to combine two pr
Approximation Techniques for High Performance Texture Mapping
Accurate perspective mapping in real-time requires costly division operations per pixel and therefore ap proximation techniques are often employed. These per mit the mapping to be performed by interpolation, but generally with a significant set-up cost for the computa tion of
Chance constrained problems: penalty reformulation and performance of sample approximation technique
We explore reformulation of nonlinear stochastic programs with several joint chance constraints by stochastic programs with suitably chosen penalty-type objectives. We show that the two problems are asymptotically equivalent. Simpler cases with one chance constraint and particula
Stress Approximation Technique for Helical Compression Springs Subjected to Lateral Loading
Scott G. Keller University of Central Florida Orlando, Florida, USA Ali P. Gordon University of Central Florida Orlando, Florida, USA ABSTRACT Helical compression springs are commonly used devices capable of storing kinetic energy. Typical applications vary in simplicity, ranging