4926 search results - page 433 / 986 » Two Graph Algorithms On an Associative Computing Model |
168
click to vote
CCGRID
2008
IEEE
15 years 6 months ago
2008
IEEE
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
135
click to vote
DAC
2005
ACM
16 years 5 months ago
2005
ACM
In the design of highly complex, heterogeneous, and concurrent systems, deadlock detection and resolution remains an important issue. In this paper, we systematically analyze the ...
122
click to vote
GBRPR
2007
Springer
15 years 8 months ago
2007
Springer
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by it...
126
click to vote
BIRTHDAY
2009
Springer
15 years 11 months ago
2009
Springer
We present a new hybrid BDD and SAT-based algorithm for model checking. Our algorithm is based on backward search, where each pre-image computation consists of an efficient All-SA...
105
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
In this paper we investigate the affect of various acceptance conditions on recogniser membrane systems without dissolution. We demonstrate that two particular acceptance conditio...