Sciweavers

2681 search results - page 130 / 537
» Problem F
Sort
View
ICASSP
2011
IEEE
13 years 2 months ago
Bounded gradient projection methods for sparse signal recovery
The 2- 1 sparse signal minimization problem can be solved efficiently by gradient projection. In many applications, the signal to be estimated is known to lie in some range of va...
James Hernandez, Zachary T. Harmany, Daniel Thomps...
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
14 years 2 months ago
Towards an evolutionary tool for the allocation of supermarket shelf space
In this paper we set the first steps towards the development of a commercially viable tool that uses evolutionary computation to address the Product to Shelf Allocation Problem (P...
Anna Esparcia-Alcázar, Lidia Lluch-Revert, ...
CEC
2009
IEEE
14 years 5 months ago
Differential Evolution with Laplace mutation operator
— Differential Evolution (DE) is a novel evolutionary approach capable of handling non-differentiable, non-linear and multi-modal objective functions. DE has been consistently ra...
Millie Pant, Radha Thangaraj, Ajith Abraham, Crina...
INFOCOM
2009
IEEE
14 years 5 months ago
Minimizing the Cost of Mine Selection Via Sensor Networks
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
Changlei Liu, Guohong Cao
COMBINATORICA
2008
84views more  COMBINATORICA 2008»
13 years 10 months ago
Parity check matrices and product representations of squares
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
Assaf Naor, Jacques Verstraëte