Sciweavers

227 search results - page 33 / 46
» Approximation of the Quadratic Set Covering problem
Sort
View
ICASSP
2009
IEEE
14 years 2 months ago
Block Jacobi-type methods for non-orthogonal joint diagonalisation
In this paper, we study the problem of non-orthogonal joint diagonalisation of a set of real symmetric matrices. A family of block Jacobitype methods are proposed to optimise two ...
Hao Shen, Knut Hüper
WIOPT
2006
IEEE
14 years 1 months ago
Scheduling sensor activity for point information coverage in wireless sensor networks
Abstract— An important application of wireless sensor networks is to perform the monitoring missions, for example, to monitor some targets of interests at all times. Sensors are ...
Bang Wang, Kee Chaing Chua, Vikram Srinivasan, Wei...
GECCO
2008
Springer
139views Optimization» more  GECCO 2008»
13 years 8 months ago
Coordinate change operators for genetic algorithms
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...
Elizabeth F. Wanner, Eduardo G. Carrano, Ricardo H...
RECOMB
2004
Springer
14 years 7 months ago
Perfect phylogeny and haplotype assignment
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
Eran Halperin, Richard M. Karp
STACS
2010
Springer
14 years 2 months ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri