719 search results - page 51 / 144 » Solving Sparse Linear Constraints |
PC
2002
14 years 10 months ago
2002
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...
SIAMJO
2011
14 years 5 months ago
2011
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
CGF
2007
14 years 10 months ago
2007
Geometric constraints have proved to be efficient for enhancing the realism of shape animation. The present paper addresses the computation and the preservation of the volume enc...
CONSTRAINTS
2002
14 years 10 months ago
2002
Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring tha...
162
click to vote
CP
2009
Springer
15 years 11 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...