Sciweavers

1279 search results - page 15 / 256
» Fast Implementations of Automata Computations
Sort
View
CCP
2011
136views more  CCP 2011»
12 years 7 months ago
Fast Implementation of Block Motion Estimation Algorithms in Video Encoders
This project will involve analysing some of the newer fast algorithms in comparison with an exhaustive full search algorithm for motion estimation in video encoders. It will invest...
Naga Rohini Koduri, Mqhele E. Dlodlo, Gerhard de J...
TACAS
2009
Springer
109views Algorithms» more  TACAS 2009»
14 years 2 months ago
TaPAS: The Talence Presburger Arithmetic Suite
TAPAS is a suite of libraries dedicated to FO (R, Z, +, ≤). The suite provides (1) the application programming interface GENEPI for this logic with encapsulations of many classic...
Jérôme Leroux, Gérald Point
JCC
2008
132views more  JCC 2008»
13 years 7 months ago
The implementation of a fast and accurate QM/MM potential method in Amber
Abstract: Version 9 of the Amber simulation programs includes a new semi-empirical hybrid QM/MM functionality. This includes support for implicit solvent (generalized Born) and for...
Ross C. Walker, Michael F. Crowley, David A. Case
IPPS
2006
IEEE
14 years 1 months ago
On-chip and on-line self-reconfigurable adaptable platform: the non-uniform cellular automata case
In spite of the high parallelism exhibited by cellular automata architectures, most implementations are usually run in software. For increasing execution parallelism, hardware imp...
Andres Upegui, Eduardo Sanchez
SPIN
2010
Springer
13 years 6 months ago
An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models
This paper addresses the problem of verifying programs for the relaxed memory models implemented in modern processors. Specifically, it considers the TSO (Total Store Order) relax...
Alexander Linden, Pierre Wolper