161 search results - page 8 / 33 » Structural decompositions for problems with global constrain... |
ICCAD
1995
IEEE
15 years 1 months ago
1995
IEEE
—A problem in technology mapping is that the quality of the final implementation depends significantly on the initially provided circuit structure. This problem is critical, es...
PARA
1995
Springer
15 years 1 months ago
1995
Springer
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, t...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
WWW
2009
ACM
15 years 10 months ago
2009
ACM
The run-time binding of web services has been recently put forward in order to support rapid and dynamic web service compositions. With the growing number of alternative web servi...
CSCLP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Among, Common and Disjoint are global constraints useful in modelling problems involving resources. We study a number of variations of these constraints over integer and ...