30 search results - page 4 / 6 » Compile-time Computation of Polytime Functions |
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
In graph mining, a frequency measure is anti-monotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pat...
AIPS
2009
14 years 10 months ago
2009
abstraction heuristics, notably pattern-database and merge-and-shrink heuristics, are employed by some state-ofthe-art optimal heuristic-search planners. The major limitation of t...
IPPS
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper introduces an adaptive parallel pipeline pattern which follows the GRASP (Grid-Adaptive Structured Parallelism) methodology. GRASP is a generic methodology to incorpora...
HASKELL
2006
ACM
15 years 3 months ago
2006
ACM
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
EUROPAR
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. In this paper, we address two key trends in the synthesis of implementations for embedded multiprocessors — (1) the increasing importance of managing interprocessor com...