Sciweavers

3020 search results - page 445 / 604
» Optimal partition trees
Sort
View
INFOCOM
2006
IEEE
16 years 14 days ago
A Comparative Study of the DNS Design with DHT-Based Alternatives
— The current Domain Name System (DNS) follows a hierarchical tree structure. Several recent efforts proposed to re-implement DNS as a peer-to-peer network with a flat structure...
Vasileios Pappas, Daniel Massey, Andreas Terzis, L...
IPPS
2005
IEEE
16 years 1 days ago
An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs)
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
Guojing Cong, David A. Bader
DCOSS
2005
Springer
15 years 12 months ago
Routing Explicit Side Information for Data Compression in Wireless Sensor Networks
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
Huiyu Luo, Gregory J. Pottie
GECCO
2005
Springer
15 years 12 months ago
Evaluating GP schema in context
We propose a new methodology to look at the fitness contributions (semantics) of different schemata in Genetic Programming (GP). We hypothesize that the significance of a schem...
Hammad Majeed, Conor Ryan, R. Muhammad Atif Azad
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
15 years 12 months ago
Linear Time Algorithms for Generalized Edge Dominating Set Problems
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
André Berger, Ojas Parekh