Sciweavers

937 search results - page 72 / 188
» On the Complexity of Partial Order Properties
Sort
View
COCOON
2001
Springer
15 years 10 months ago
PC-Trees vs. PQ-Trees
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
Wen-Lian Hsu
PPOPP
2009
ACM
16 years 6 months ago
Formal verification of practical MPI programs
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our app...
Anh Vo, Sarvani S. Vakkalanka, Michael Delisi, Gan...
ECRTS
2002
IEEE
15 years 11 months ago
Managing Multi-Mode Tasks with Time Cost and Quality Levels using Optimal Discrete Control Synthesis
Real-time control systems are complex to design, and automation support is important. We are interested in systems with multiple tasks, each with multiple modes, implementing a fu...
Hervé Marchand, Éric Rutten
WOA
2000
15 years 7 months ago
OO Reactive Agents for RDM-Based Simulations
The computer simulation of complex phenomena is a challenging issue for studying their properties. Several models and techniques have been developed in order to provide useful con...
Stefania Bandini, Flavio De Paoli, Sara Manzoni, C...
AIPS
2009
15 years 7 months ago
Extended Goals for Composing Services
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...
Eirini Kaldeli, Alexander Lazovik, Marco Aiello