Sciweavers

2270 search results - page 141 / 454
» On the distribution of eigenvalues of graphs
Sort
View
IPPS
2009
IEEE
16 years 1 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker
IPPS
2006
IEEE
16 years 12 days ago
Concurrent counting is harder than queuing
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
Srikanta Tirthapura, Costas Busch
SIGIR
2008
ACM
15 years 6 months ago
A large time-aware web graph
We describe the techniques developed to gather and distribute in a highly compressed, yet accessible, form a series of twelve snapshot of the .uk web domain. Ad hoc compression
Paolo Boldi, Massimo Santini, Sebastiano Vigna
EC
2006
163views ECommerce» more  EC 2006»
15 years 6 months ago
An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms
The frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. Th...
Boris Mitavskiy, Jonathan E. Rowe
PDP
2003
IEEE
15 years 11 months ago
Load Balancing for Spatial-grid-based Parallel Numeric Simulations on Clusters of SMPs
Load distribution is an essential factor to parallel efficiency of numerical simulations that are based on spatial grids, especially on clusters of symmetric multiprocessors (SMPs...
Huaien Gao, Andreas Schmidt, Amitava Gupta, Peter ...