428 search results - page 37 / 86 » An asynchronous complete method for distributed constraint o... |
134
click to vote
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
Multi-view learning algorithms typically assume a complete bipartite mapping between the different views in order to exchange information during the learning process. However, ma...
119
click to vote
ICCAD
1997
IEEE
15 years 7 months ago
1997
IEEE
† This paper describes a novel methodology to automate the design of the interconnect distribution for multistage clock circuits. We introduce two key ideas. First, a hierarchica...
127
click to vote
AAAI
2000
15 years 4 months ago
2000
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
136
Voted
EDBT
2008
ACM
16 years 3 months ago
2008
ACM
In situations where class labels are known for a part of the objects, a cluster analysis respecting this information, i.e. semi-supervised clustering, can give insight into the cl...
147
Voted
ATAL
2007
Springer
15 years 9 months ago
2007
Springer
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...