We consider a possible scenario of experimental analysis on heuristics for optimization: identifying the contribution of local search components when algorithms are evaluated on th...
We consider the linear classification method consisting of separating two sets of points in d-space by a hyperplane. We wish to determine the hyperplane which minimises the sum of...
Frank Plastria, Steven De Bruyne, Emilio Carrizosa
This paper is concerned with a specific brand of evolutionary algorithms: Memetic algorithms. A new local search technique with an adaptive neighborhood setting process is introdu...
—The full-complexity soft-input/soft-output (SISO) multiuser detector based on the a posteriori probability (APP) algorithm has a computational complexity growing exponentially w...
In this paper, we define a network service provider game. We show that the price of anarchy of the defined game can be bounded by analyzing a local search heuristic for a related...
Nikhil R. Devanur, Naveen Garg, Rohit Khandekar, V...