Sciweavers

749 search results - page 93 / 150
» Combinatory Models and Symbolic Computation
Sort
View
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 10 months ago
Synchronization recovery and state model reduction for soft decoding of variable length codes
Abstract-- Variable length codes (VLCs) exhibit desynchronization problems when transmitted over noisy channels. Trellis decoding techniques based on Maximum A Posteriori (MAP) est...
Simon Malinowski, Herve Jegou, Christine Guillemot
GAMEON
2003
13 years 11 months ago
Multi-Agent Based Modelling: from Social Simulation to Real Time Strategy Games
Simulation has been regarded as the third way to represent social models, alternative to other two symbol systems: the verbal argumentation and the mathematical one. Simulation ca...
Marco Remondino
FOSSACS
2009
Springer
14 years 4 months ago
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
Christopher Broadbent, C.-H. Luke Ong
ACSD
2007
IEEE
93views Hardware» more  ACSD 2007»
13 years 12 months ago
SAT-based Unbounded Model Checking of Timed Automata
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
Wojciech Penczek, Maciej Szreter
IFM
2009
Springer
124views Formal Methods» more  IFM 2009»
14 years 4 months ago
Dynamic Path Reduction for Software Model Checking
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
Zijiang Yang, Bashar Al-Rawi, Karem Sakallah, Xiao...