scholarly journals Parallelizing Combinatorial Optimization Heuristics with GPUs

2018 ◽  
Vol 3 (6) ◽  
pp. 265-280 ◽  
Author(s):  
Mohammad Harun Rashid ◽  
Lixin Tao
Keyword(s):  
Combinatorial Optimization ◽  
Optimization Heuristics ◽  
Combinatorial Optimization Heuristics

scholarly journals Clustering Binary Data by Application of Combinatorial Optimization Heuristics

2021 ◽  
pp. 301-309
Author(s):  
Javier Trejos-Zelaya ◽  
Luis Eduardo Amaya-Briceño ◽  
Alejandra Jiménez-Romero ◽  
Alex Murillo-Fernández ◽  
Eduardo Piza-Volio ◽  
...  
Keyword(s):  
Combinatorial Optimization ◽  
Binary Data ◽  
Optimization Heuristics ◽  
Combinatorial Optimization Heuristics

APPLYING COMBINATORIAL OPTIMIZATION HEURISTICS FOR ENHANCING THE PERFORMANCE OF TH-PPM UWB SYSTEMS: CHAOTIC VERSUS CLASSICAL CODE SEQUENCES

2012 ◽  
Vol 22 (11) ◽  
pp. 1250260
Author(s):  
ANIS NAANAA ◽  
SAFYA BELGHITH
Keyword(s):  
Combinatorial Optimization ◽  
Multiple Access ◽  
Channel Model ◽  
Additive White Gaussian Noise ◽  
Wide Band ◽  
Optimization Method ◽  
Guided Local Search ◽  
Chaotic Sequences ◽  
Optimization Heuristics ◽  
User Interference

In this article, we propose a process to minimize the Multi-User Interference (MUI) caused by Multiple Access (MA) in a Time Hopping Ultra Wide Band (TH-UWB) system with No Line-Of-Sight (NLOS) multipath channel in a residential environment IEEE 802.15.4a Channel Model 2 (CM2). We discuss both synchronous and asynchronous channels with an Additive White Gaussian Noise (AWGN). The choice of codes allowing multiple access is crucial for minimizing the MUI and to improve the system performance. Recently much works has been done in order to optimize performance by code selection [Bravo et al., 1999; Moreno & Marić, 2000; Guvenc & Arslan, 2004]. This paper is a contribution to this research axis. The minimization of the MUI is formulated as a Combinatorial Optimization Problem (COP) and solved by means of an efficient generic optimization method called Guided Local Search (GLS) [Voudouris, 1997]. In this context, we exploit the richness of chaotic sequences with respect to topologic properties. Simulation results based on the Binary Error Rate (BER) show that optimized chaotic sequences outperforms the classical code sequences.

Combinatorial Optimization Method Based on Evaluation of Proximate Optimality Using Correlation Coefficient

2015 ◽  
Vol 135 (4) ◽  
pp. 466-467 ◽  
Author(s):  
Masahide Morita ◽  
Hiroki Ochiai ◽  
Kenichi Tamura ◽  
Junichi Tsuchiya ◽  
Keiichiro Yasuda
Keyword(s):  
Combinatorial Optimization ◽  
Correlation Coefficient ◽  
Optimization Method
Sign in / Sign up

Export Citation Format

Share Document