Sciweavers

9626 search results - page 1498 / 1926
» Invariant Based Programming
Sort
View
AMAST
2008
Springer
15 years 8 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
15 years 8 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
ARC
2008
Springer
155views Hardware» more  ARC 2008»
15 years 8 months ago
Run-time Adaptable Architectures for Heterogeneous Behavior Embedded Systems
As embedded applications are getting more complex, they are also demanding highly diverse computational capabilities. The majority of all previously proposed reconfigurable archite...
Antonio Carlos Schneider Beck, Mateus B. Rutzig, G...
BPM
2008
Springer
155views Business» more  BPM 2008»
15 years 8 months ago
The Refined Process Structure Tree
Abstract. We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a ...
Jussi Vanhatalo, Hagen Völzer, Jana Koehler
ETFA
2008
IEEE
15 years 8 months ago
Adaptive real-time scheduling for legacy applications
A remarkable research activity has been carried out in the past few years to support real-time applications by means of appropriate scheduling solutions. For scarcely known or hig...
Luca Abeni, Luigi Palopoli
« Prev « First page 1498 / 1926 Last » Next »