Sciweavers

739 search results - page 53 / 148
» Sorting Algorithms
Sort
View
EOR
2008
91views more  EOR 2008»
13 years 8 months ago
A branch-and-bound algorithm for the linear ordering problem with cumulative costs
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
Giovanni Righini
ANOR
2010
130views more  ANOR 2010»
13 years 6 months ago
Greedy scheduling with custom-made objectives
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...
IPPS
1998
IEEE
14 years 1 months ago
Random Sampling Techniques in Parallel Computation
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
Rajeev Raman
IPPS
1997
IEEE
14 years 10 days ago
Designing Efficient Distributed Algorithms Using Sampling Techniques
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
Sanguthevar Rajasekaran, David S. L. Wei
SIPS
2007
IEEE
14 years 3 months ago
MIMO Detector Based on Viterbi Algorithm
: - Suboptimal detectors of multiple-input multiple-output (MIMO) have been studied because the implementation of the optimum detector, the maximum-likelihood (ML) detector, has so...
Jin Lee, Sin-Chong Park