Sciweavers

1157 search results - page 42 / 232
» Descriptive Complexity and Model Checking
Sort
View
WWW
2002
ACM
14 years 10 months ago
Model checking cobweb protocols for verification of HTML frames behavior
HTML documents composed of frames can be difficult to write correctly. We demonstrate a technique that can be used by authors manually creating HTML documents (or by document edit...
P. David Stotts, Jaime Navon
AICOM
2005
97views more  AICOM 2005»
13 years 9 months ago
The Ants' Garden: Complex interactions between populations and the scalability of qualitative models
Ecological theories often explain the behaviour of communities in terms of the underlying interactions that take place between the species that are part of the community. This clos...
Bert Bredeweg, Paulo Salles
RIVF
2003
13 years 11 months ago
Complex Systems Modeling
—This paper addresses the simulation of the dynamics of complex systems by using hierarchical graph and multi-agent system. A complex system is composed of numerous interacting p...
Christophe Lecerf, Thi Minh Luan Nguyen
ICC
2008
IEEE
141views Communications» more  ICC 2008»
14 years 4 months ago
Multilevel Structured Low-Density Parity-Check Codes
— Low-Density Parity-Check (LDPC) codes are typically characterized by a relatively high-complexity description, since a considerable amount of memory is required in order to sto...
Nicholas Bonello, Sheng Chen, Lajos Hanzo
LICS
2006
IEEE
14 years 4 months ago
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
C.-H. Luke Ong