Sciweavers

409 search results - page 6 / 82
» Matching Scenarios with Timing Constraints
Sort
View
VLSISP
2008
132views more  VLSISP 2008»
13 years 7 months ago
Scenario Selection and Prediction for DVS-Aware Scheduling of Multimedia Applications
Modern multimedia applications usually have real-time constraints and they are implemented using application-domain specific embedded processors. Dimensioning a system requires acc...
Stefan Valentin Gheorghita, Twan Basten, Henk Corp...
SCESM
2006
ACM
238views Algorithms» more  SCESM 2006»
14 years 1 months ago
Nobody's perfect: interactive synthesis from parametrized real-time scenarios
As technical systems keep growing more complex and sophisticated, designing software for the safety-critical coordination between their components becomes increasingly difficult....
Holger Giese, Stefan Henkler, Martin Hirsch, Flori...
ATAL
2004
Springer
14 years 1 months ago
Time-Variant Distributed Agent Matching Applications
The process of pair partnership formation is an important infrastructure for many plausible MAS applications. Each agent evaluates potential partner agents, where each potential m...
David Sarne, Sarit Kraus
EON
2008
13 years 9 months ago
Abductive Synthesis of the Mediator Scenario with jABC and GEM
We reuse here the framework, the setting, and the semantic modelling for the automated synthesis of the SWS Challenge Mediator presented in the companion paper [5], and show how to...
Christian Kubczak, Tiziana Margaria, Matthias Kais...
TIME
1998
IEEE
13 years 12 months ago
Tackling the Qualification Problem using Fluent Dependency Constraints: Preliminary Report
The use of causal rules or fluent dependency constraints has proven to provide a versatile means of dealing with the ramification problem. In this paper we show how fluent depende...
Patrick Doherty, Jonas Kvarnström