Sciweavers

503 search results - page 14 / 101
» Probabilistic Weighted Automata
Sort
View
IJFCS
2007
63views more  IJFCS 2007»
13 years 8 months ago
Path-Equivalent Developments in Acyclic Weighted Automata
Weighted finite automata (WFA) are used with FPGA accelerating hardware to scan large genomic banks. Hardwiring such automata raises surface area and clock frequency constraints,...
Mathieu Giraud, Philippe Veber, Dominique Lavenier
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 8 months ago
Minimal weight expansions in Pisot bases
For applications to cryptography, it is important to represent numbers with a small number of non-zero digits (Hamming weight) or with small absolute sum of digits. The problem of ...
Christiane Frougny, Wolfgang Steiner
ICALP
2010
Springer
14 years 1 months ago
Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
Abstract. This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Empti...
Hugo Gimbert, Youssouf Oualhadj
ICTAI
2003
IEEE
14 years 1 months ago
Genetic Algorithm Calibration of Probabilistic Cellular Automata for Modeling Mining Permit Activity
We use a genetic algorithm to calibrate a spatially and temporally resolved cellular automata to model mining activity on public land in Idaho and western Montana. The genetic alg...
Sushil J. Louis, Gary L. Raines
ENTCS
2006
117views more  ENTCS 2006»
13 years 8 months ago
Probabilistic and Nondeterministic Aspects of Anonymity
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
Catuscia Palamidessi