|
|
|
Felipe Martins Müller and Iaê Santos Bonilha
Hyper-heuristics comprise a set of approaches that are motivated (at least in part) by the objective of intelligently combining heuristic methods to solve hard optimization problems. Ant colony optimization (ACO) algorithms have been proven to deal with ...
ver más
|
|
|
|
|
|
Jiaolong Wang and Zeyang Chen
Motivated by the rapid progress of aerospace and robotics engineering, the navigation and control systems on matrix Lie groups have been actively studied in recent years. For rigid targets, the attitude estimation problem is a benchmark one with its stat...
ver más
|
|
|
|
|
|
Mohammad Hossein Same, Gabriel Gleeton, Gabriel Gandubert, Preslav Ivanov and Rene Jr Landry
By increasing the demand for radio frequency (RF) and access of hackers and spoofers to low price hardware and software defined radios (SDR), radio frequency interference (RFI) became a more frequent and serious problem. In order to increase the security...
ver más
|
|
|
|
|
|
Yi-Bo Li, Hong-Bao Sang, Xiang Xiong and Yu-Rou Li
This paper proposes the hybrid adaptive genetic algorithm (HAGA) as an improved method for solving the NP-hard two-dimensional rectangular packing problem to maximize the filling rate of a rectangular sheet. The packing sequence and rotation state are en...
ver más
|
|
|
|
|
|
Yanfeng Zhang, Yunbao Huang, Haiyan Li, Pu Li and Xi?an Fan
We propose a new iterative greedy algorithm to reconstruct sparse signals in Compressed Sensing. The algorithm, called Conjugate Gradient Hard Thresholding Pursuit (CGHTP), is a simple combination of Hard Thresholding Pursuit (HTP) and Conjugate Gradient...
ver más
|
|
|