197 search results - page 9 / 40 » Complexity of Max-SAT using stochastic algorithms |
IAT
2006
IEEE
15 years 3 months ago
2006
IEEE
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
CVPR
1999
IEEE
15 years 11 months ago
1999
IEEE
We present a stochastic clustering algorithm which uses pairwise similarity of elements, based on a new graph theoretical algorithm for the sampling of cuts in graphs. The stochas...
CVPR
2000
IEEE
15 years 1 months ago
2000
IEEE
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...
AAAI
2011
13 years 9 months ago
2011
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
WSC
2004
14 years 11 months ago
2004
Monte Carlo techniques have long been used (since Buffon's experiment to approximate the value of by tossing a needle onto striped paper) to analyze phenomena which, due to ...