Sciweavers

3211 search results - page 506 / 643
» On the Grundy Number of a Graph
Sort
View
STOC
1997
ACM
97views Algorithms» more  STOC 1997»
14 years 1 months ago
Using and Combining Predictors That Specialize
Abstract. We study online learning algorithms that predict by combining the predictions of several subordinate prediction algorithms, sometimes called “experts.” These simple a...
Yoav Freund, Robert E. Schapire, Yoram Singer, Man...
ECP
1997
Springer
68views Robotics» more  ECP 1997»
14 years 1 months ago
Ignoring Irrelevant Facts and Operators in Plan Generation
It is traditional wisdom that one should start from the goals when generating a plan in order to focus the plan generation process on potentially relevant actions. The graphplan sy...
Bernhard Nebel, Yannis Dimopoulos, Jana Koehler
KDD
1997
ACM
161views Data Mining» more  KDD 1997»
14 years 1 months ago
Automated Discovery of Active Motifs in Three Dimensional Molecules
In this paper 1 we present a method for discovering approximately common motifs (also known as active motifs) in three dimensional (3D) molecules. Each node in a molecule is repre...
Xiong Wang, Jason Tsong-Li Wang, Dennis Shasha, Br...
ICDE
1993
IEEE
158views Database» more  ICDE 1993»
14 years 1 months ago
Data fragmentation for parallel transitive closure strategies
A topic that is currently inspiring a lot of research is parallel (distributed) computation of transitive closure queries. In [lo] the disconnection set approach has been introduc...
Maurice A. W. Houtsma, Peter M. G. Apers, Gideon L...
EUROSYS
2010
ACM
14 years 1 months ago
Locating cache performance bottlenecks using data profiling
Effective use of CPU data caches is critical to good performance, but poor cache use patterns are often hard to spot using existing execution profiling tools. Typical profilers at...
Aleksey Pesterev, Nickolai Zeldovich, Robert T. Mo...