Filters








239,738 Hits in 6.2 sec

Adaptive-loop method for non-deterministic design optimization

B. D. Youn
2007 Proceedings of the Institution of Mechanical Engineers. Part O, Journal of risk and reliability  
While deterministic design optimization and the single-loop method will improve numerical efficiency at the beginning and end of non-deterministic design optimization, the parallel-loop method maintains  ...  Examples are used to demonstrate the effectiveness of the adaptive-loop method in terms of numerical efficiency and stability.  ...  ACKNOWLEDGEMENTS Research is partially supported by the STAS contract (TCN-05122) sponsored by the U.S. Army TARDEC. Special thank is given to Mr Wang who prepared the implementation of the code.  ... 
doi:10.1243/1748006xjrr50 fatcat:rhqzfajknndn7bucbokohhrc6y

Memoized Pull-Tabbing for Functional Logic Programming [article]

Michael Hanus, Finn Teegen
2020 arXiv   pre-print
Pull-tab steps are local graph transformations to move non-deterministic choices towards the root of an expression.  ...  Pull-tabbing is an evaluation technique for functional logic programs which computes all non-deterministic results in a single graph structure.  ...  We call this improved strategy memoized pull-tabbing (MPT ). Memoized pull-tabbing can reduce the complexity of non-deterministic computations.  ... 
arXiv:2008.11999v1 fatcat:i7c6gnt22jblveiamsljjgkwwe

Optimization schemas for parallel implementation of non‐deterministic languages and systems

Gopal Gupta, Enrico Pontelli
2001 Software, Practice & Experience  
of non-deterministic systems/languages to reduce the parallel overhead and to obtain improved efficiency of parallel execution.  ...  We present three optimization schemas based on flattening of the computation tree, procrastination of overheads, and sequentialization of computations that can be systematically applied to parallel implementations  ...  This is indeed how we improved the efficiency of the ACE parallel logic programming system.  ... 
doi:10.1002/spe.405 fatcat:z5y3twzfinbl5lnxel6ggaizka

Improving Lazy Non-Deterministic Computations by Demand Analysis

Michael Hanus, Marc Herbstritt
2012 International Conference on Logic Programming  
Functional logic languages combine lazy (demand-driven) evaluation strategies from functional programming with non-deterministic computations from logic programming.  ...  On the other hand, this improvement could cause efficiency problems if unevaluated subexpressions are duplicated and later evaluated in different parts of a program.  ...  Conclusions We have shown a program transformation to improve the efficiency of non-deterministic computations in implementations of functional logic languages with a demand-driven strategy.  ... 
doi:10.4230/lipics.iclp.2012.130 dblp:conf/iclp/Hanus12 fatcat:brk5o7y5rvajrgcoiqkpnxgop4

A Queue-oriented Transaction Processing Paradigm [article]

Thamir M. Qadah
2019 arXiv   pre-print
A fundamental characteristic of classical transaction processing protocols is non-determinism, which causes them to suffer from performance issues on modern computing environments such as main-memory databases  ...  Recent proposals of deterministic transaction processing techniques have shown great potential in addressing these performance issues.  ...  The author would also like to thank the anonymous referees and Yahya Javed for their valuable comments and helpful suggestions.  ... 
arXiv:1910.10350v1 fatcat:c5xzszsjzbem3eugi5ti4hke5e

Non-Deterministic Parallelism Considered Useful

Derek Gordon Murray, Steven Hand
2011 USENIX Workshop on Hot Topics in Operating Systems  
Applications of non-determinism Non-determinism can be used to improve the performance of many applications.  ...  Bounded non-determinism Some computations have deterministic outputs, but may use non-determinism internally to obtain a result more efficiently.  ... 
dblp:conf/hotos/MurrayH11 fatcat:xebvuo6ifbfc3lufza36vyeet4

REM (Reduce Elan Machine): Core of the New ELAN Compiler [chapter]

Pierre-Etienne Moreau
2000 Lecture Notes in Computer Science  
We can also benefit from the deterministic analysis to improve the efficiency of AC-matching and to detect some non-terminating strategies.  ...  In the syntactic case as in the AC case, the major source of efficiency is the use of compiled deterministic discrimination trees.  ... 
doi:10.1007/10721975_19 fatcat:cbl7ef7k5zbj3lirzv74yefsxm

Fast Min-Cost Buffer Insertion under Process Variations

Ruiming Chen, Hai Zhou
2007 Proceedings - Design Automation Conference  
Our approaches have less than 9% runtime overhead on average compared with a single pass of deterministic buffering for delay constrained buffering, and get 56% yield improvement and 11.8% buffer area  ...  We propose efficient dynamic programming approaches to handle the min-cost buffer insertion under process variations.  ...  So the number of picked statistical solutions to be merged is close to the number of deterministic non-inferior solutions, which can greatly improve the efficiency of the algorithm.  ... 
doi:10.1109/dac.2007.375183 fatcat:usjvlhjdojg4havpbh5zxk45uq

Fast min-cost buffer insertion under process variations

Ruiming Chen, Hai Zhou
2007 Proceedings - Design Automation Conference  
Our approaches have less than 9% runtime overhead on average compared with a single pass of deterministic buffering for delay constrained buffering, and get 56% yield improvement and 11.8% buffer area  ...  We propose efficient dynamic programming approaches to handle the min-cost buffer insertion under process variations.  ...  So the number of picked statistical solutions to be merged is close to the number of deterministic non-inferior solutions, which can greatly improve the efficiency of the algorithm.  ... 
doi:10.1145/1278480.1278567 dblp:conf/dac/ChenZ07 fatcat:37fxkqoqtngnvim33b5jdsw5y4

Fast Buffer Insertion for Yield Optimization Under Process Variations

Ruiming Chen, Hai Zhou
2007 2007 Asia and South Pacific Design Automation Conference  
The experimental results demonstrate that the exiting approaches cannot handle large cases efficiently or effectively, while our algorithm handles large cases very efficiently, and improves the yield more  ...  In this paper, we propose a buffer insertion algorithm with the consideration of process variations.  ...  The number of statistical solutions is reduced to the number of deterministic solutions, so the algorithm is efficient. We use a one-phase merge procedure in FSBI.  ... 
doi:10.1109/aspdac.2007.357786 dblp:conf/aspdac/ChenZ07 fatcat:n4ktzcterrflvhqiv44e53ygra

An Improved Parameter Computation Method for a MIMO V2V Rayleigh Fading Channel Simulator Under Non-Isotropic Scattering Environments

Xiang Cheng, Qi Yao, Cheng-Xiang Wang, Bo Ai, Gordon L. Stuber, Dongfeng Yuan, Bing-Li Jiao
2013 IEEE Communications Letters  
Compared with the existing relevant methods, the proposed method has the same simulation efficiency but provides a better approximation to the desired statistical properties of the theoretical reference  ...  For simulations of multiple-input multiple-output (MIMO) vehicle-to-vehicle (V2V) Rayleigh fading channels under more realistic non-isotropic scattering scenarios, we propose a new parameter computation  ...  In this letter, we propose a new parameter computation method, named as improved MMEA (IMMEA), for the design of multiple-input multiple-output (MIMO) V2V deterministic SoS channel simulators under non-isotropic  ... 
doi:10.1109/lcomm.2013.011113.121535 fatcat:djvoypuycjaybnfzhqofk5fgu4

Descriptive and Geographical Analysis of Flood Disaster Evacuation Modelling

Ahmed T. Elsergany, Amy L. Griffin, Paul Tranter, Sameer Alam
2014 International Conference on Information Systems for Crisis Response and Management  
environs, when probabilities of decision variables are considered in the evacuation plans.  ...  The planning of evacuation operations for a riverine flood disaster is vital for minimizing their negative impacts on human lives.  ...  However, considerable improvements were made in evacuee's average travel times in the proportional non-linear and proportional and stochastic evolutionary computation models.  ... 
dblp:conf/iscram/ElserganyGTA14 fatcat:z3errozmizcbhcl3zosq2h5vym

Reliability-based design optimization of adhesive bonded steel–concrete composite beams with probabilistic and non-probabilistic uncertainties

Yangjun Luo, Alex Li, Zhan Kang
2011 Engineering structures  
The validity of the proposed formulation as well as the efficiency of the presented numerical techniques is demonstrated by a mathematical example.  ...  greatly reduces the burdensome computation workloads in seeking the optimal design.  ...  As the most mature non-deterministic design approach, the RBDO has been successfully used in many real-life engineering applications [9,10].  ... 
doi:10.1016/j.engstruct.2011.02.040 fatcat:vr2svjtc5rhfth4wmxatdphib4

Reduction of Non Deterministic Automata for Hidden Markov Model Based Pattern Recognition Applications [chapter]

Frederic Maire, Frank Wathne, Alain Lifchitz
2003 Lecture Notes in Computer Science  
In a previous paper, we showed that non-deterministic automata were computationally more efficient than tries.  ...  We present experimental results demonstrating a significant reduction in the number of labels in the automata.  ...  Factorization of HMMs into Non-Deterministic Automata If two words have a common prefix then the DP computations of the a posteriori probabilities can be factorized.  ... 
doi:10.1007/978-3-540-24581-0_39 fatcat:e5mnhbdfxnhjxmd4dkryox6dga

On Deterministic Computations in the Extended Andorra Model [chapter]

Ricardo Lopes, Vítor Santos Costa, Fernando Silva
2003 Lecture Notes in Computer Science  
Warren's design for the EAM with Implicit Control does not perform well for deterministic computations and we present several optimisations that allow the BEAM to achieve performance matching or even exceeding  ...  Logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very powerful framework that supports both co-routining and parallelism.  ...  Namely, we are studying stability, originally proposed for AGENTS, as a further technique for optimising execution of non-deterministic programs.  ... 
doi:10.1007/978-3-540-24599-5_28 fatcat:55yi2izhzjhdba5xqwdygzqynu
« Previous Showing results 1 — 15 out of 239,738 results