2299 search results - page 190 / 460 » A Class of Hypercube-Like Networks |
145
click to vote
MOBICOM
2006
ACM
16 years 13 days ago
2006
ACM
Determining node positions is essential for many next-generation network functionalities. Previous localization algorithms lack correctness guarantees or require network density h...
157
click to vote
INFOCOM
2005
IEEE
16 years 1 days ago
2005
IEEE
Abstract—This paper presents an analytic framework to evaluate the performance of peer to peer (P2P) networks. Using the time to download or replicate an arbitrary file as the m...
159
click to vote
GC
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...
181
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In developing algorithms that dynamically changes the structure and weights of ANN (Artificial Neural Networks), there must be a proper balance between network complexit...
153
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar t...