3471 search results - page 549 / 695 » Obstacle Numbers of Graphs |
140
click to vote
ECP
1997
Springer
15 years 10 months ago
1997
Springer
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...
169
click to vote
KDD
1997
ACM
15 years 10 months ago
1997
ACM
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...
189
click to vote
ICDE
1993
IEEE
15 years 10 months ago
1993
IEEE
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...
144
Voted
EUROSYS
2010
ACM
15 years 10 months ago
2010
ACM
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...
147
click to vote
COLT
1989
Springer
15 years 10 months ago
1989
Springer
The present paper considers the effects of introducing inaccuracies in a learner’s environment in Gold’s learning model of identification in the limit. Three kinds of inaccu...