1844 search results - page 50 / 369 » Exploiting the Structure of Distributed Constraint Optimizat... |
102
click to vote
INFOCOM
2012
IEEE
13 years 1 months ago
2012
IEEE
Abstract—Network power consumption can be reduced considerably by adapting link data rates to their offered traffic loads. In this paper, we exploit how to leverage rate adaptat...
HPCA
1999
IEEE
15 years 3 months ago
1999
IEEE
In general-purpose microprocessors, recent trends have pushed towards 64-bit word widths, primarily to accommodate the large addressing needs of some programs. Many integer proble...
AIPS
2000
15 years 17 days ago
2000
Despite the importance of the management of inventory in industrial scheduling applications, there has been little research that has addressed reasoning about inventory directly a...
127
click to vote
ICTAI
2009
IEEE
14 years 9 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
ISSAC
2007
Springer
15 years 5 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...