Sciweavers

720 search results - page 49 / 144
» Linear k-arboricities on trees
Sort
View
AAAI
1996
13 years 10 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf
DATE
2005
IEEE
169views Hardware» more  DATE 2005»
14 years 2 months ago
Context-Aware Scheduling Analysis of Distributed Systems with Tree-Shaped Task-Dependencies
In this paper we present a new technique which exploits timing-correlation between tasks for scheduling analysis in multiprocessor and distributed systems with tree-shaped task-de...
Rafik Henia, Rolf Ernst
HPCC
2005
Springer
14 years 2 months ago
A Coarse Grained Parallel Algorithm for Closest Larger Ancestors in Trees with Applications to Single Link Clustering
Hierarchical clustering methods are important in many data mining and pattern recognition tasks. In this paper we present an efficient coarse grained parallel algorithm for Single...
Albert Chan, Chunmei Gao, Andrew Rau-Chaplin
CAV
2003
Springer
160views Hardware» more  CAV 2003»
14 years 1 months ago
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
Jan Obdrzálek
FSTTCS
2007
Springer
14 years 17 days ago
Efficient and Expressive Tree Filters
Abstract. We investigate streaming evaluation of filters on XML documents, evaluated both at the root node and at an arbitrary node. Motivated by applications in protocol processin...
Michael Benedikt, Alan Jeffrey