1289 search results - page 72 / 258 » Complexity of Counting the Optimal Solutions |
WIA
2004
Springer
15 years 3 months ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
ISCAS
2003
IEEE
15 years 3 months ago
2003
IEEE
The discrete multitone (DMT)transceivers have enjoyed great success in high speed data transmission. It is known that when the cyclicprefix is no shorterthan the channel impulse r...
AAAI
2006
14 years 11 months ago
2006
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...
TVLSI
2008
14 years 9 months ago
2008
Subthreshold circuit designs have been demonstrated to be a successful alternative when ultra-low power consumption is paramount. However, the characteristics of MOS transistors in...
PIMRC
2008
IEEE
15 years 4 months ago
2008
IEEE
—In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks dedicated to Internet access. Routing and transmission scheduling have a majo...