1389 search results - page 161 / 278 » Parallel Algorithms for Treewidth Two |
112
Voted
CPAIOR
2006
Springer
15 years 6 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
155
click to vote
CIARP
2009
Springer
15 years 10 days ago
2009
Springer
Abstract. Parallel texts are enriched by alignment algorithms, thus establishing a relationship between the structures of the implied languages. Depending on the alignment level, t...
121
click to vote
IEEEPACT
1998
IEEE
15 years 6 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
100
click to vote
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
130
Voted
TVCG
2011
14 years 9 months ago
2011
We present two novel algorithms for constructing spatial hierarchies on GPUs. The first is for kd-trees that automatically balances between the level of parallelism and total mem...