Sciweavers

11716 search results - page 21 / 2344
» Computable symbolic dynamics
Sort
View
DCC
2005
IEEE
14 years 9 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
ATVA
2005
Springer
108views Hardware» more  ATVA 2005»
14 years 3 months ago
Flat Acceleration in Symbolic Model Checking
Abstract. Symbolic model checking provides partially effective verification procedures that can handle systems with an infinite state space. So-called “acceleration techniques...
Sébastien Bardin, Alain Finkel, Jér&...
ACSC
2005
IEEE
14 years 3 months ago
Graph Grammar Encoding and Evolution of Automata Networks
The global dynamics of automata networks (such as neural networks) are a function of their topology and the choice of automata used. Evolutionary methods can be applied to the opt...
Martin H. Luerssen
FROCOS
2000
Springer
14 years 1 months ago
Non-Trivial Symbolic Computations in Proof Planning
Abstract. We discuss a pragmatic approach to integrate computer algebra into proof planning. It is based on the idea to separate computation and veri cation and can thereby exploit...
Volker Sorge
AISC
2008
Springer
13 years 11 months ago
Symbolic Computation Software Composability
We present three examples of the composition of Computer Algebra Systems to illustrate the progress on a composability infrastructure as part of the SCIEnce (Symbolic Computation I...
Sebastian Freundt, Peter Horn, Alexander Konovalov...