-
1
-
-
0022581781
-
Minimum probability of error for asynchronous Gaussian multiple-access channels
-
S. Verdu: Minimum Probability of Error for Asynchronous Gaussian Multiple-access Channels. IEEE Transactions on Information Theory,Vol.32 (1986) 85-96.
-
(1986)
IEEE Transactions on Information Theory
, vol.32
, pp. 85-96
-
-
Verdu, S.1
-
2
-
-
0010185175
-
Computational complexity of optimal multiuser detection
-
S. Verdu: Computational Complexity of Optimal Multiuser Detection. Algorithmica, vol.4 (1989) 303-312.
-
(1989)
Algorithmica
, vol.4
, pp. 303-312
-
-
Verdu, S.1
-
4
-
-
0037352997
-
Mulatiuser detection for DS-CDMA systems using evolutionary programming
-
H.S.Lim, M.V.C.Rao, Alan W.C. Tan, H.T.Chuah: Mulatiuser Detection for DS-CDMA Systems Using Evolutionary Programming. IEEE Communications Letters, Vol.7 (2003) 101-103.
-
(2003)
IEEE Communications Letters
, vol.7
, pp. 101-103
-
-
Lim, H.S.1
Rao, M.V.C.2
Tan, A.W.C.3
Chuah, H.T.4
-
5
-
-
0034314145
-
A gradient guided search algorithm for multiuser detection
-
Jun Hu, Rick S.Blum: A Gradient Guided Search Algorithm for Multiuser Detection. IEEE Communications Letters, Vol.4 (2000) 340-342.
-
(2000)
IEEE Communications Letters
, vol.4
, pp. 340-342
-
-
Hu, J.1
Blum, R.S.2
-
6
-
-
0042592953
-
An efficient local search heuristics for asynchronous multiuser detection
-
H.S.Lim, B. Venkatesh: An Efficient Local Search Heuristics for Asynchronous Multiuser Detection. IEEE Communications Letters, Vol.7 (2003) 299-30.
-
(2003)
IEEE Communications Letters
, vol.7
, pp. 299-330
-
-
Lim, H.S.1
Venkatesh, B.2
-
7
-
-
7544236843
-
Multiuser detection in CDMA-A comparison of relaxations, exact, and Heuristic search methods
-
Peng Hui Tan, Lars K. Rasmussen: Multiuser Detection in CDMA-A Comparison of Relaxations, Exact, and Heuristic Search Methods. IEEE Transactions on Wireless Communicatons, Vol.3 (2004) 1802-1809.
-
(2004)
IEEE Transactions on Wireless Communicatons
, vol.3
, pp. 1802-1809
-
-
Tan, P.H.1
Rasmussen, L.K.2
-
8
-
-
0024991769
-
Correlated and uncorrelated fitness landscapes and how to tell the difference
-
E.D. Weinberger: Correlated and Uncorrelated Fitness Landscapes and How to Tell the Difference. Biological Cybernetics, Vol.63 (1990) 325-336.
-
(1990)
Biological Cybernetics
, vol.63
, pp. 325-336
-
-
Weinberger, E.D.1
-
9
-
-
0034315990
-
Fitness landscape analysis and memetic algorithms for the quadratic assignment problem
-
Peter Merz, Bernd Freisleben: Fitness Landscape Analysis and Memetic Algorithms for the Quadratic Assignment Problem. IEEE Transactions on Evolutionary Computation, Vol.4 (2000) 337-352.
-
(2000)
IEEE Transactions on Evolutionary Computation
, vol.4
, pp. 337-352
-
-
Merz, P.1
Freisleben, B.2
-
10
-
-
1642531209
-
Fitness landscape
-
Springer-Verlag Berlin Heidelberg
-
P.F. Stadler: Fitness Landscape. Lecture Notes in Physics, Springer-Verlag Berlin Heidelberg, (2002)183-204.
-
(2002)
Lecture Notes in Physics
, pp. 183-204
-
-
Stadler, P.F.1
-
11
-
-
0005798485
-
An experimental design perspective on genetic algorithms
-
L.D. Whitley and M. D. Vose, Eds. San Mateo, CA: Morgan Kaufmann
-
C. Reeves, C. Wright: An experimental design perspective on genetic algorithms. Foundations of Genetic Algorithms 3, L.D. Whitley and M. D. Vose, Eds. San Mateo, CA: Morgan Kaufmann, (1995) 7-22.
-
(1995)
Foundations of Genetic Algorithms
, vol.3
, pp. 7-22
-
-
Reeves, C.1
Wright, C.2
-
12
-
-
0033732270
-
A comparison of predictive measure of problem difficulty in evolutionary algorithms
-
Bart Naudts, Leila Kallel: A Comparison of Predictive Measure of Problem Difficulty in Evolutionary Algorithms. IEEE Transactions on Evolutionary Computation, Vol.4 (2000) 1-15.
-
(2000)
IEEE Transactions on Evolutionary Computation
, vol.4
, pp. 1-15
-
-
Naudts, B.1
Kallel, L.2
-
13
-
-
0003579258
-
-
Cambridge University Press, Cambridge, U.K.
-
S. Verdu: Multiuser Detection. Cambridge University Press, Cambridge, U.K. (1998).
-
(1998)
Multiuser Detection
-
-
Verdu, S.1
-
15
-
-
0036496382
-
Greedy and local search heuristics for unconstrained binary quadratic programming
-
P. Merz and B. Freisleben: Greedy and local search heuristics for unconstrained binary quadratic programming. Journal of Heuristics, vol. 8 (2002)197-213.
-
(2002)
Journal of Heuristics
, vol.8
, pp. 197-213
-
-
Merz, P.1
Freisleben, B.2
|