580 search results - page 38 / 116 » On the memory complexity of the forward-backward algorithm |
DAC
2003
ACM
14 years 8 months ago
2003
ACM
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
SARA
2009
Springer
14 years 7 days ago
2009
Springer
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
JGAA
2006
13 years 7 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
VLSID
1997
IEEE
13 years 12 months ago
1997
IEEE
The problem of test generation belongs to the class of NP-complete problems and it is becoming more and more di cult as the complexity of VLSI circuits increases, and as long as e...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
The next generation of advanced self-protection jammers is expected to deliver effective and energy efficient jamming against modern air tracking radars. However, optimizing such ...