Sciweavers

797 search results - page 56 / 160
» Observing Success in the Pi-Calculus
Sort
View
CSDA
2010
118views more  CSDA 2010»
14 years 9 months ago
Grapham: Graphical models with adaptive random walk Metropolis algorithms
Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementat...
Matti Vihola
CVGIP
2010
182views more  CVGIP 2010»
14 years 9 months ago
MCCD: Multi-core collision detection between deformable models using front-based decomposition
We present a novel parallel algorithm for fast continuous collision detection (CCD) between deformable models using multi-core processors. We use a hierarchical representation to ...
Min Tang, Dinesh Manocha, Ruofeng Tong
IJNSEC
2008
119views more  IJNSEC 2008»
14 years 9 months ago
Customizing Cellular Message Encryption Algorithm
This paper observes the cryptanalysis of the Telecommunications Industry Association's Cellular Message Encryption Algorithm (CMEA). The CMEA has been widely used for wireles...
Debdeep Mukhopadhyay, Dipanwita Roy Chowdhury
ENGL
2007
121views more  ENGL 2007»
14 years 9 months ago
A Comparison between Genetic Algorithms and Evolutionary Programming based on Cutting Stock Problem
—Genetic Algorithms (GA) and Evolutionary Programming (EP) are two well-known optimization methods that belong to the class of Evolutionary Algorithms (EA). Both methods have gen...
Raymond Chiong, Ooi Koon Beng
IJISTA
2007
119views more  IJISTA 2007»
14 years 9 months ago
Online modelling based on Genetic Programming
: Genetic Programming (GP), a heuristic optimisation technique based on the theory of Genetic Algorithms (GAs), is a method successfully used to identify non-linear model structure...
Stephan M. Winkler, Hajrudin Efendic, Luigi del Re...