Sciweavers

3229 search results - page 168 / 646
» The Theory of Timed Automata
Sort
View
ARITH
2005
IEEE
16 years 4 days ago
The Residue Logarithmic Number System: Theory and Implementation
— The Residue Logarithmic Number System (RLNS) represents real values as quantized logarithms which, in turn, are represented using the Residue Number System (RNS). Compared to t...
Mark G. Arnold
CIKM
1997
Springer
15 years 10 months ago
Learning Belief Networks from Data: An Information Theory Based Approach
This paper presents an efficient algorithm for learning Bayesian belief networks from databases. The algorithm takes a database as input and constructs the belief network structur...
Jie Cheng, David A. Bell, Weiru Liu
EC
1998
178views ECommerce» more  EC 1998»
15 years 6 months ago
The Simple Genetic Algorithm and the Walsh Transform: Part I, Theory
This paper is the first part of a two part series. It proves a number of direct relationships between the Fourier transform and the simple genetic algorithm. (For a binary repres...
Michael D. Vose, Alden H. Wright
ETFA
2008
IEEE
16 years 1 months ago
Reactivity analysis of different Networked Automation System architectures
The reactivity of Networked Automation Systems (NAS) has direct influence on safety and quality aspects. It can be determined by a response time analysis, which itself can be calc...
Jürgen Greifeneder, Georg Frey
IFIP
2004
Springer
15 years 12 months ago
The Firing Squad Synchronization Problem with Many Generals For One-Dimensional CA
Abstract The Firing Squad Synchronization Problem is one of the classical problems for cellular automata. In this paper we consider the case of more than one general. A synchronous...
Hubert Schmid, Thomas Worsch