Sciweavers

620 search results - page 51 / 124
» Algorithms and computations on cellular automata
Sort
View
PARELEC
2006
IEEE
15 years 6 months ago
Building Mini-Grid Environments with Virtual Private Networks: A Pragmatic Approach
At our university, we have a number of small-tomedium-size compute clusters and some technical simulations which could benefit from using several of these clusters simulaneously....
Christian Kauhaus, Dietmar Fey
82
Voted
ECAL
2001
Springer
15 years 5 months ago
Pareto Optimality in Coevolutionary Learning
We develop a novel coevolutionary algorithm based upon the concept of Pareto optimality. The Pareto criterion is core to conventional multi-objective optimization (MOO) algorithms....
Sevan G. Ficici, Jordan B. Pollack
ICPR
2008
IEEE
15 years 7 months ago
Cellular automaton for ultra-fast watershed transform on GPU
In this paper we describe a cellular automaton (CA) used to perform the watershed transform in N-D images. Our method is based on image integration via the Ford-Bellman shortest p...
Claude Kauffmann, Nicolas Piche
ICDCS
2007
IEEE
15 years 6 months ago
A Virtual Node-Based Tracking Algorithm for Mobile Networks
— We introduce a virtual-node based mobile object tracking algorithm for mobile sensor networks, VINESTALK. The algorithm uses the Virtual Stationary Automata programming layer, ...
Tina Nolte, Nancy A. Lynch
64
Voted
WCNC
2010
IEEE
14 years 11 months ago
Applying Spring-Relaxation Technique in Cellular Network Localization
—This paper presents a simple solution suitable for the mandatory localization function for E-911 services specified by FCC. Our solution introduces zero-length spring technique...
Qing Zhang, Chuan Heng Foh, Boon-Chong Seet, Alvis...