122 search results - page 5 / 25 » Using Disjoint Reachability for Parallelization |
69
Voted
CHARME
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we explore a parallelization of BMC based on state space partitioning. The parallelization is accomplished by executing multiple instances of BMC independently from ...
113
click to vote
HSNMC
2004
Springer
15 years 2 months ago
2004
Springer
This paper describes a new update algorithm for Internet Protocol (IP) forwarding tables. The update algorithm is so general that it can be combined with many IP address lookup alg...
FSTTCS
2004
Springer
15 years 2 months ago
2004
Springer
This paper deals with distributed control problems by means of distributed games played on Mazurkiewicz traces. The main difference with other notions of distributed games recentl...
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
Graph-cuts optimization is prevalent in vision and graphics problems. It is thus of great practical importance to parallelize the graph-cuts optimization using today’s ubiquitou...
ATVA
2008
Springer
14 years 11 months ago
2008
Springer
We present a tool for parallel shared-memory enumerative LTL model-checking and reachability analysis. The tool is based on distributed-memory algorithms reimplemented specifically...