16404 search results - page 103 / 3281 » A set coverage problem |
134
click to vote
ICRA
2009
IEEE
15 years 9 months ago
2009
IEEE
— In this paper, we propose a path planning method for nonholonomic multi-vehicle system in presence of moving obstacles. The objective is to find multiple fixed length paths f...
120
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...
112
click to vote
IVC
2000
15 years 3 months ago
2000
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
110
click to vote
SWAT
2004
Springer
15 years 8 months ago
2004
Springer
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
133
click to vote
JNSM
2008
15 years 3 months ago
2008
We optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph analysis. We begin by predicting all possible ways of penetrating a networ...