Sciweavers

3913 search results - page 411 / 783
» complexity 2006
Sort
View
FORMATS
2006
Springer
15 years 10 months ago
Symbolic Robustness Analysis of Timed Automata
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
Conrado Daws, Piotr Kordy
FOSSACS
2006
Springer
15 years 10 months ago
A Finite Model Construction for Coalgebraic Modal Logic
In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove tha...
Lutz Schröder
FPL
2006
Springer
103views Hardware» more  FPL 2006»
15 years 10 months ago
A System Design Methodology for Reducing System Integration Time and Facilitating Modular Design Verification
This paper provides a realistic case study of using the previously introduced SIMPPL system architectural model, which fixes the physical interface and communication protocols bet...
Lesley Shannon, Blair Fort, Samir Parikh, Arun Pat...
FPL
2006
Springer
98views Hardware» more  FPL 2006»
15 years 10 months ago
Self-Reconfigurable Pervasive Platform for Cryptographic Application
The complexity exhibited by pervasive systems is constantly increasing. Customer electronics devices provide day to day a larger amount of functionalities. A common approach for g...
Arnaud Lagger, Andres Upegui, Eduardo Sanchez, Iva...
GECCO
2006
Springer
178views Optimization» more  GECCO 2006»
15 years 10 months ago
Adaptively choosing niching parameters in a PSO
Niching techniques play an important role in evolutionary algorithms. Existing niching methods often require userspecified parameters, limiting their usefulness. This paper propos...
Stefan Bird, Xiaodong Li