1424 search results - page 60 / 285 » The Multi-radius Cover Problem |
140
click to vote
ESA
2003
Springer
15 years 6 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
94
Voted
CCCG
2007
15 years 2 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
119
click to vote
COCOON
2005
Springer
15 years 6 months ago
2005
Springer
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
93
Voted
CORR
2008
Springer
15 years 26 days ago
2008
Springer
In their seminal paper in the ACM Transactions on Software Engineering and Methodology, Zave and Jackson established a core ontology for Requirements Engineering (RE) and used it ...
112
click to vote
DIMEA
2008
15 years 2 months ago
2008
The educational community is willing to approach the learning applications to the engaging and immersive formats of multimedia and video games as a way of increasing the motivatio...