1138 search results - page 72 / 228 » Parallel Implementation of Constraint Solving |
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
VLSID
1997
IEEE
13 years 12 months ago
1997
IEEE
The problem of test generation belongs to the class of NP-complete problems and it is becoming more and more di cult as the complexity of VLSI circuits increases, and as long as e...
CCO
2001
Springer
14 years 8 days ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
HPCS
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— In recent years our society has witnessed an unprecedented growth in computing power available to tackle important problems in science, engineering and medicine. For ex...
AMC
2010
13 years 7 months ago
2010
: Parallel iterative methods are powerful tool for solving large system of linear equations (LEs). The existing parallel computing research results are focussed mainly on sparse sy...