Sciweavers

2905 search results - page 356 / 581
» Formal Memetic Algorithms
Sort
View
IPPS
2007
IEEE
15 years 10 months ago
Static-Priority Scheduling and Resource Hold Times
The duration of time for which each application locks each shared resource is critically important in composing multiple independently-developed applications upon a shared “open...
Marko Bertogna, Nathan Fisher, Sanjoy K. Baruah
ATVA
2007
Springer
136views Hardware» more  ATVA 2007»
15 years 10 months ago
Symbolic Fault Tree Analysis for Reactive Systems
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...
Marco Bozzano, Alessandro Cimatti, Francesco Tappa...
132
Voted
CSL
2007
Springer
15 years 10 months ago
Qualitative Temporal and Spatial Reasoning Revisited
Abstract. Establishing local consistency is one of the main algorithmic techniques in temporal and spatial reasoning. In this area, one of the central questions for the various pro...
Manuel Bodirsky, Hubie Chen
ICDT
2007
ACM
141views Database» more  ICDT 2007»
15 years 10 months ago
Exact XML Type Checking in Polynomial Time
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
Sebastian Maneth, Thomas Perst, Helmut Seidl
119
Voted
TACAS
2007
Springer
144views Algorithms» more  TACAS 2007»
15 years 10 months ago
Detecting Races in Ensembles of Message Sequence Charts
Abstract. The analysis of message sequence charts (MSCs) is highly important in preventing common problems in communication protocols. Detecting race conditions, i.e., possible dis...
Edith Elkind, Blaise Genest, Doron Peled