17770 search results - page 263 / 3554 » A Generalization of Forward-Backward Algorithm |
201
click to vote
JDA
2006
15 years 7 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
234
click to vote
ALGORITHMICA
1998
15 years 6 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
167
click to vote
ISSAC
2007
Springer
16 years 1 months ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
194
click to vote
CDC
2009
IEEE
15 years 12 months ago
2009
IEEE
—Designing efficient scheduling algorithms is an important problem in a general class of networks with resourcesharing constraints, such as wireless networks and stochastic proc...
166
click to vote
SIGCSE
1997
ACM
15 years 11 months ago
1997
ACM
Algorithm animation has been applied to a huge variety of algorithms, and has been found to be of enormous benefit in assisting with their comprehension. However, the radical natu...