251 search results - page 33 / 51 » Constructive Linear Time Algorithms for Branchwidth |
107
click to vote
ISPAN
2002
IEEE
15 years 2 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
87
Voted
CAD
2008
Springer
14 years 9 months ago
2008
Springer
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
CSL
2009
Springer
15 years 4 months ago
2009
Springer
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
74
Voted
TAMC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
IJCAI
2003
14 years 11 months ago
2003
We present a novel, laser range finder based algorithm for simultaneous localization and mapping (SLAM) for mobile robots. SLAM addresses the problem of constructing an accurate ...