Sciweavers

269 search results - page 21 / 54
» Computing with Probabilistic Cellular Automata
Sort
View
IJFCS
2008
108views more  IJFCS 2008»
13 years 8 months ago
On the Computation of the Relative Entropy of Probabilistic Automata
Corinna Cortes, Mehryar Mohri, Ashish Rastogi, Mic...
AHSWN
2010
177views more  AHSWN 2010»
13 years 8 months ago
Dynamic Point Coverage Problem in Wireless Sensor Networks: A Cellular Learning Automata Approach
One way to prolong the lifetime of a wireless sensor network is to schedule the active times of sensor nodes, so that a node is active only when it is really needed. In the dynami...
Mehdi Esnaashari, Mohammad Reza Meybodi
CORR
2008
Springer
89views Education» more  CORR 2008»
13 years 8 months ago
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilisti...
Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand...
ICCAD
2005
IEEE
93views Hardware» more  ICCAD 2005»
14 years 5 months ago
Eliminating wire crossings for molecular quantum-dot cellular automata implementation
— When exploring computing elements made from technologies other than CMOS, it is imperative to investigate the effects of physical implementation constraints. This paper focuses...
Amitabh Chaudhary, Danny Z. Chen, Kevin Whitton, M...