Sciweavers

88 search results - page 12 / 18
» A Parallel Monte-Carlo Tree Search Algorithm
Sort
View
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
14 years 1 months ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold
ICDM
2002
IEEE
91views Data Mining» more  ICDM 2002»
14 years 17 days ago
Mining Molecular Fragments: Finding Relevant Substructures of Molecules
We present an algorithm to find fragments in a set of molecules that help to discriminate between different classes of, for instance, activity in a drug discovery context. Instea...
Christian Borgelt, Michael R. Berthold
WWW
2011
ACM
13 years 2 months ago
Growing parallel paths for entity-page discovery
In this paper, we use the structural and relational information on the Web to find entity-pages. Specifically, given a Web site and an entity-page (e.g., department and faculty ...
Tim Weninger, Fabio Fumarola, Cindy Xide Lin, Rick...
CCGRID
2009
IEEE
14 years 2 months ago
Multicast Trees for Collaborative Applications
—Current implementations of real-time collaborative applications rely on a dedicated infrastructure to carry out all synchronizing and communication functions, and require all en...
Krzysztof Rzadca, Jackson Tan Teck Yong, Anwitaman...
FLOPS
2010
Springer
13 years 6 months ago
A Skeleton for Distributed Work Pools in Eden
We present a flexible skeleton for implementing distributed work pools in our parallel functional language Eden. The skeleton manages a pool of tasks (work pool) in a distributed ...
Mischa Dieterle, Jost Berthold, Rita Loogen