3208 search results - page 510 / 642 » A Lower Bound for Primality |
152
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
155
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
This work introduces a combinatorial optimization problem called Mars Express Memory Dumping Problem (Mex-Mdp), which arises in the European Space Agency program Mars Express. It c...
167
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
Recently, Fabrikant, Koutsoupias and Papadimitriou [7] introduced a natural and beautifully simple model of network growth involving a trade-off between geometric and network obje...
185
click to vote
WEA
2010
Springer
15 years 11 months ago
2010
Springer
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
175
click to vote
HICSS
2002
IEEE
15 years 11 months ago
2002
IEEE
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...