Sciweavers

895 search results - page 50 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
80
Voted
PKDD
2007
Springer
107views Data Mining» more  PKDD 2007»
15 years 5 months ago
An Empirical Comparison of Exact Nearest Neighbour Algorithms
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
Ashraf M. Kibriya, Eibe Frank
IPPS
2005
IEEE
15 years 4 months ago
A Cellular Multi-Objective Genetic Algorithm for Optimal Broadcasting Strategy in Metropolitan MANETs
Mobile Ad-hoc Networks (MANETs) are composed of a set of communicating devices which are able to spontaneously interconnect without any pre-existing infrastructure. In such scenar...
Enrique Alba, Bernabé Dorronsoro, Francisco...
CSB
2003
IEEE
15 years 4 months ago
Haplotype Motifs: An Algorithmic Approach to Locating Evolutionarily Conserved Patterns in Haploid Sequences
The promise of plentiful data on common human genetic variations has given hope that we will be able to uncover genetic factors behind common diseases that have proven difficult ...
Russell Schwartz
94
Voted
CGF
2006
125views more  CGF 2006»
14 years 11 months ago
Translational Covering of Closed Planar Cubic B-Spline Curves
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
Cristina Neacsu, Karen Daniels
COMPGEOM
2006
ACM
15 years 4 months ago
Minimum-cost coverage of point sets by disks
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
Helmut Alt, Esther M. Arkin, Hervé Brö...