1844 search results - page 138 / 369 » Exploiting the Structure of Distributed Constraint Optimizat... |
164
Voted
IEEECIT
2010
IEEE
15 years 3 months ago
2010
IEEE
—Superblocks represent regions in a program code that consist of multiple basic blocks. Compilers benefit from this structure since it enables optimization across block boundari...
172
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...
149
click to vote
IFIP
2004
Springer
15 years 10 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
143
click to vote
ICMCS
2009
IEEE
15 years 2 months ago
2009
IEEE
We consider the problem of classification of multiple observations of the same object, possibly under different transformations. We view this problem as a special case of semi-sup...
165
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...