The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
Siddhartha Jain, Serdar Kadioglu, Meinolf Sellmann
Minimum variance beamforming, which uses a weight vector that maximizes the signal-to-interference-plus-noise ratio (SINR), is often sensitive to estimation error and uncertainty i...
Seung-Jean Kim, Alessandro Magnani, Almir Mutapcic...
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
Abstract—Compressive sensing is a new signal acquisition technology with the potential to reduce the number of measurements required to acquire signals that are sparse or compres...