43 search results - page 7 / 9 » Fully dynamic algorithms for chordal graphs and split graphs |
AI
1999
Springer
13 years 7 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
ISPDC
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
FCCM
2002
IEEE
14 years 26 days ago
2002
IEEE
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
BPM
2006
Springer
13 years 11 months ago
2006
Springer
Composition languages like BPEL and many enactment tools only support structured process models, while most composition approaches only consider unstructured models. In this paper,...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...