1127 search results - page 70 / 226 » Theory Extension in ACL2(r) |
109
Voted
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
105
Voted
MOBIHOC
2009
ACM
16 years 1 months ago
2009
ACM
Location-free boundary recognition is crucial and critical for many fundamental network functionalities in wireless ad hoc and sensor networks. Previous designs, often coarse-grai...
104
Voted
CADE
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
105
Voted
MOBIHOC
2008
ACM
16 years 11 days ago
2008
ACM
Channel allocation was extensively investigated in the framework of cellular networks, but it was rarely studied in the wireless ad-hoc networks, especially in the multi-hop ad-ho...
100
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...