Sciweavers

4377 search results - page 327 / 876
» Mass problems and randomness
Sort
View
PE
2008
Springer
81views Optimization» more  PE 2008»
15 years 6 months ago
Using cross-system diversity in heterogeneous networks: Throughput optimization
This paper investigates the situation where a group of terminals can be simultaneously connected to several base stations using distinct technologies on nonoverlapping frequency b...
Samson Lasaulce, Alberto Suárez 0002, Raul ...
169
Voted
TC
2008
15 years 6 months ago
Optimal and Practical Algorithms for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
JACM
2007
79views more  JACM 2007»
15 years 6 months ago
A new look at survey propagation and its generalizations
This article provides a new conceptual perspective on survey propagation, which is an iterative algorithm recently introduced by the statistical physics community that is very effe...
Elitza N. Maneva, Elchanan Mossel, Martin J. Wainw...
TSMC
1998
78views more  TSMC 1998»
15 years 6 months ago
Automata learning and intelligent tertiary searching for stochastic point location
—Consider the problem of a robot (learning mechanism or algorithm) attempting to locate a point on a line. The mechanism interacts with a random environment which essentially inf...
B. John Oommen, Govindachari Raghunath
INFOCOM
2010
IEEE
15 years 5 months ago
Optimal Linear Network Coding Design for Secure Unicast with Multiple Streams
—Linear network coding is a promising technology that can maximize the throughput capacity of communication network. Despite this salient feature, there are still many challenges...
Jin Wang, Jianping Wang, Kejie Lu, Bin Xiao, Naiji...