7943 search results - page 1414 / 1589 » A calculus for costed computations |
189
click to vote
MOBIHOC
2005
ACM
16 years 6 months ago
2005
ACM
Mobile ad hoc networks (MANETs) are vulnerable to routing attacks, especially attacks launched by non-cooperative (selfish or compromised) network members and appear to be protoco...
197
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
174
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
In this paper we present the B-coder, an efficient binary arithmetic coder that performs extremely well on a wide range of data. The B-coder should be classed as an `approximate&#...
201
click to vote
MOBIHOC
2003
ACM
16 years 6 months ago
2003
ACM
On demand routing protocols provide scalable and costeffective solutions for packet routing in mobile wireless ad hoc networks. The paths generated by these protocols may deviate ...
187
click to vote
POPL
2010
ACM
16 years 3 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...