432 search results - page 27 / 87 » Internally deterministic parallel algorithms can be fast |
ESA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We consider the multivariate interlace polynomial introduced by Courcelle (2008), which generalizes several interlace polynomials defined by Arratia, Bollob´as, and Sor...
111
click to vote
JAIR
2006
14 years 11 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
CONCUR
2006
Springer
15 years 1 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
ICS
2000
Tsinghua U.
15 years 3 months ago
2000
Tsinghua U.
Loop fusion is important to optimizing compilers because it is an important tool in managing the memory hierarchy. By fusing loops that use the same data elements, we can reduce t...
104
Voted
ICCV
2001
IEEE
16 years 1 months ago
2001
IEEE
The problem of extracting continuous structures from noisy or cluttered images is a difficult one. Successful extraction depends critically on the ability to balance prior constra...