Sciweavers

TCIAIG
2010
12 years 10 months ago
Evaluating Root Parallelization in Go
Abstract--Parallelizing Monte-Carlo tree search has been considered to be a way to improve the strength of computer Go programs. In this paper, we analyze the performance of two ro...
Yusuke Soejima, Akihiro Kishimoto, Osamu Watanabe
AAAI
2004
13 years 5 months ago
A Computational Study of the Kemeny Rule for Preference Aggregation
We consider from a computational perspective the problem of how to aggregate the ranking preferences of a number of alternatives by a number of different voters into a single cons...
Andrew J. Davenport, Jayant Kalagnanam
ICDCS
1999
IEEE
13 years 8 months ago
Providing Support for Survivable CORBA Applications with the Immune System
The Immune system aimsto provide survivabilityto CORBA applications, enabling them to continue to operate despite malicious attacks, accidents, or faults. Every object within the ...
Priya Narasimhan, Kim Potter Kihlstrom, Louise E. ...
ICPR
2008
IEEE
13 years 10 months ago
Clustering by evidence accumulation on affinity propagation
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Xuqing Zhang, Fei Wu, Yueting Zhuang
CCGRID
2009
IEEE
13 years 10 months ago
Collusion Detection for Grid Computing
A common technique for result verification in grid computing is to delegate a computation redundantly to different workers and apply majority voting to the returned results. Howe...
Eugen Staab, Thomas Engel