1461 search results - page 205 / 293 » Complexity of Graph Covering Problems |
AGTIVE
2007
Springer
14 years 3 months ago
2007
Springer
The usability of model transformation languages depends on the abstractions one can work with in rules to perform complex operations on models. Recently, we have introduced a novel...
DAC
1994
ACM
14 years 1 months ago
1994
ACM
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...
PSTV
1993
13 years 10 months ago
1993
We present a new algorithm that can be used for solving the model−checking problem for linear−time temporal logic. This algorithm can be viewed as the combination of two exist...
SIGSOFT
2008
ACM
2008
ACM
Experience in using a process language to define scientific workflow and generate dataset provenance
14 years 9 months ago
This paper describes our experiences in exploring the applicability of software engineering approaches to scientific data management problems. Specifically, this paper describes h...
ASPDAC
2004
ACM
14 years 2 months ago
2004
ACM
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we use a novel topo...