Sciweavers

112 search results - page 16 / 23
» Searching Game Trees in Parallel Using SSS
Sort
View
WWW
2011
ACM
14 years 4 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...
67
Voted
SAC
2004
ACM
15 years 3 months ago
A parallel algorithm for the extraction of structured motifs
In this work we propose a parallel algorithm for the efficient extraction of binding-site consensus from genomic sequences. This algorithm, based on an existing approach, extracts...
Alexandra M. Carvalho, Arlindo L. Oliveira, Ana T....
WSC
2008
15 years 18 hour ago
The improved sweep metaheuristic for simulation optimization and application to job shop scheduling
We present an improved sweep metaheuristic for discrete event simulation optimization. The sweep algorithm is a tree search similar to beam search. The basic idea is to run a limi...
George Jiri Mejtsky
CCGRID
2009
IEEE
15 years 4 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...
ICDM
2002
IEEE
91views Data Mining» more  ICDM 2002»
15 years 2 months 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