1844 search results - page 103 / 369 » Exploiting the Structure of Distributed Constraint Optimizat... |
151
Voted
KDD
2012
ACM
13 years 5 months ago
2012
ACM
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
118
Voted
ISPD
2004
ACM
15 years 8 months ago
2004
ACM
Considering the voltage drop constraint over a distributed model for power/ground (P/G) network, we study the following two problems for physical synthesis of sleep transistors: t...
126
Voted
VMCAI
2009
Springer
15 years 9 months ago
2009
Springer
Abstract There is an intimate link between program structure and behaviour. Exploiting this link to phrase program correctness problems in terms of the structural properties of a p...
113
Voted
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...
119
Voted
NHM
2010
14 years 9 months ago
2010
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...