1612 search results - page 250 / 323 » Analysing Randomized Distributed Algorithms |
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. T...
171
Voted
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
To deal with data uncertainty, existing probabilistic database systems augment tuples with attribute-level or tuple-level probability values, which are loaded into the database al...
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
— Since the Estimation of Distribution Algorithms (EDAs) have been introduced, several single model based EDAs and mixture model based EDAs have been developed. Take Gaussian mod...
HPDC
2008
IEEE
15 years 4 months ago
2008
IEEE
Self-configuring virtual networks rely on structured P2P routing to provide seamless connectivity among nodes through overlay routing of virtual IP packets, support decentralized...
78
Voted
GLOBECOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— A relay selection approach has previously been shown to outperform repetition-based scheduling for both amplify-and-forward (AF) and decode-and-forward (DF) cooperative network...