1347 search results - page 152 / 270 » On the Structure of the Minimum Time Function |
145
Voted
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
—We consider a cognitive radio network with distributed multiple secondary users, where each user independently searches for spectrum opportunities in multiple channels without e...
168
click to vote
FROCOS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present an overview of results on hierarchical and modular reasoning in complex theories. We show that for a special type of extensions of a base theory, which we call...
143
click to vote
LFCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
215
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
123
click to vote
ASPDAC
2004
ACM
15 years 9 months ago
2004
ACM
Abstract — This paper presents a functional-space decomposition approach to enhance the capability of symbolic simulation. In our symbolic simulator, the control part and datapat...