4903 search results - page 281 / 981 » The Set Covering Machine |
176
click to vote
ESWS
2007
Springer
16 years 27 days ago
2007
Springer
We investigate scalable algorithms for automated composition (WSC) of Semantic Web Services. Our notion of WSC is very general: the composition semantics includes background knowl...
142
click to vote
WADS
2007
Springer
16 years 26 days 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...
226
click to vote
ESA
2003
Springer
15 years 12 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 ...
215
click to vote
ALGOSENSORS
2007
Springer
15 years 10 months ago
2007
Springer
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible n...
194
click to vote
CONCUR
2007
Springer
15 years 10 months ago
2007
Springer
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...