Sciweavers

860 search results - page 110 / 172
» Biased Random Walks
Sort
View
CSR
2010
Springer
15 years 2 months ago
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
Uwe Schöning
PAKDD
2010
ACM
179views Data Mining» more  PAKDD 2010»
15 years 2 months ago
Answer Diversification for Complex Question Answering on the Web
We present a novel graph ranking model to extract a diverse set of answers for complex questions via random walks over a negative-edge graph. We assign a negative sign to edge weig...
Palakorn Achananuparp, Xiaohua Hu, Tingting He, Ch...
PAKDD
2001
ACM
104views Data Mining» more  PAKDD 2001»
15 years 2 months ago
Optimizing the Induction of Alternating Decision Trees
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
Bernhard Pfahringer, Geoffrey Holmes, Richard Kirk...
ICCAD
1999
IEEE
78views Hardware» more  ICCAD 1999»
15 years 2 months ago
Probabilistic state space search
This paper describes a probabilistic approach to state space search. The presented method applies a ranking of the design states according to their probability of reaching a given...
Andreas Kuehlmann, Kenneth L. McMillan, Robert K. ...
ICPR
2010
IEEE
15 years 6 days ago
Topic-Sensitive Tag Ranking
Social tagging is an increasingly popular way to describe and classify documents on the web. However, the quality of the tags varies considerably since the tags are authored freel...
Yan'An Jin, Ruixuan Li, Zhengding Lu, Kunmei Wen, ...