202 search results - page 34 / 41 » Counting Distance Permutations |
ADHOCNOW
2006
Springer
14 years 1 months ago
2006
Springer
In this paper, we outline a simple approach, called ROAR, that enables the Ad-Hoc On-Demand Distance Vector (AODV) routing protocol to strengthen its routes by recruiting neighbors...
KDD
2004
ACM
14 years 1 months ago
2004
ACM
Mark-recapture models have for many years been used to estimate the unknown sizes of animal and bird populations. In this article we adapt a finite mixture mark-recapture model i...
ICPP
2003
IEEE
14 years 1 months ago
2003
IEEE
Automatic optimization of address offset assignment for DSP applications, which reduces the number of address arithmetic instructions to meet the tight memory size restrictions an...
ISCA
2003
IEEE
14 years 1 months ago
2003
IEEE
This work examines dynamic cluster assignment for a clustered trace cache processor (CTCP). Previously proposed cluster assignment techniques run into unique problems as issue wid...
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...