400 search results - page 21 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
128
click to vote
TACAS
2010
Springer
15 years 6 months ago
2010
Springer
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
STOC
2001
ACM
16 years 4 days ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
130
click to vote
SPAA
1994
ACM
15 years 3 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
IPPS
1999
IEEE
15 years 4 months ago
1999
IEEE
A binary-tree algorithm, Bin(n), proceeds level-bylevel from the leaves of a 2n -leaf balanced binary tree to its root. This paper deals with running binary-tree algorithms on mul...
ICST
2009
IEEE
15 years 6 months ago
2009
IEEE
Constraint solving lies at the heart of several specification-based approaches to automated testing. Korat is a previously developed algorithm for solving constraints in Java pro...