Sciweavers

620 search results - page 49 / 124
» Algorithms and computations on cellular automata
Sort
View
122
Voted
FAC
2008
100views more  FAC 2008»
15 years 18 days ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
CONCUR
2008
Springer
15 years 2 months ago
Completeness and Nondeterminism in Model Checking Transactional Memories
Software transactional memory (STM) offers a disciplined concurrent programming model for exploiting the parallelism of modern processor architectures. This paper presents the firs...
Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh
CONCUR
2006
Springer
15 years 4 months ago
Probability and Nondeterminism in Operational Models of Concurrency
We give a brief overview of operational models for concurrent systems that exhibit probabilistic behavior, focussing on the interplay between probability and nondeterminism. Our su...
Roberto Segala
116
Voted
HAPTICS
2008
IEEE
15 years 7 months ago
Haptic Feedback Based on Physically Based Modeling for Cellular Manipulation Systems
This paper focuses on developing a haptic rendering technique for cellular manipulation using image processing techniques and physically based models. The interaction forces betwee...
Jungsik Kim, Farrokh Janabi-Sharifi, Jung Kim
114
Voted
GECCO
2005
Springer
134views Optimization» more  GECCO 2005»
15 years 6 months ago
Predicting mining activity with parallel genetic algorithms
We explore several different techniques in our quest to improve the overall model performance of a genetic algorithm calibrated probabilistic cellular automata. We use the Kappa ...
Sam Talaie, Ryan E. Leigh, Sushil J. Louis, Gary L...