Sciweavers

1389 search results - page 22 / 278
» Parallel Algorithms for Treewidth Two
Sort
View
TPDS
1998
71views more  TPDS 1998»
13 years 8 months ago
Parallel Algorithms for Relational Coarsest Partition Problems
—Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are 3-complete and hence it may not be possible to desig...
Sanguthevar Rajasekaran, Insup Lee
PARA
2004
Springer
14 years 1 months ago
Parallel Algorithms for Balanced Truncation Model Reduction of Sparse Systems
We describe the parallelization of an efficient algorithm for balanced truncation that allows to reduce models with state-space dimension up to O(105 ). The major computational tas...
José M. Badía, Peter Benner, Rafael ...
SODA
2010
ACM
155views Algorithms» more  SODA 2010»
14 years 5 months ago
A Space--Time Tradeoff for Permutation Problems
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
Mikko Koivisto, Pekka Parviainen
BIRTHDAY
2008
Springer
13 years 10 months ago
AND/OR Multi-valued Decision Diagrams for Constraint Networks
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...
Robert Mateescu, Rina Dechter
HPCC
2005
Springer
14 years 2 months ago
Parallel Branch and Bound Algorithms on Internet Connected Workstations
By the use of the GRIBB software for distributed computing across the Internet, we are investigating the obstacles and the potential for efficient parallelization of Branch and Bou...
Randi Moe, Tor Sørevik