80 search results - page 3 / 16 » Using Arc Weights to Improve Iterative Repair |
ISPD
1999
ACM
13 years 11 months ago
1999
ACM
Netlist partitioning is an important and well studied problem. In this paper, a linear time partitioning approach based on iterative deletion is presented. We use the partitioning...
KDD
2003
ACM
14 years 7 months ago
2003
ACM
We address the issues of discovering significant binary relationships in transaction datasets in a weighted setting. Traditional model of association rule mining is adapted to han...
ICML
2009
IEEE
14 years 1 months ago
2009
IEEE
The most commonly used learning algorithm for restricted Boltzmann machines is contrastive divergence which starts a Markov chain at a data point and runs the chain for only a few...
ATAL
2009
Springer
14 years 1 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
AIPS
2010
13 years 7 months ago
2010
Greedy search is commonly used in an attempt to generate solutions quickly at the expense of completeness and optimality. In this work, we consider learning sets of weighted actio...