155 search results - page 14 / 31 » A Comparison Between ACO Algorithms for the Set Covering Pro... |
109
Voted
WADS
2007
Springer
15 years 9 months ago
2007
Springer
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...
139
Voted
WADS
1997
Springer
15 years 7 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
193
click to vote
JCO
2006
15 years 3 months ago
2006
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
121
click to vote
PPSN
2004
Springer
15 years 8 months ago
2004
Springer
This paper presents the integration between a co-operative co-evolutionary genetic algorithm (CCGA) and four evolutionary multiobjective optimisation algorithms (EMOAs): a multi-ob...
130
click to vote
COLT
2005
Springer
15 years 9 months ago
2005
Springer
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...