1671 search results - page 223 / 335 » On the Covering Steiner Problem |
212
click to vote
JCSS
2008
15 years 6 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
225
Voted
TASE
2010
IEEE
15 years 23 days ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
136
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
Abstract. In the context of combinations of theories with disjoint signatures, we classify the component theories according to the decidability of constraint satisability problems ...
124
click to vote
ICC
2007
IEEE
16 years 11 days ago
2007
IEEE
— In this paper, we study the angle coverage problem in visual sensor networks where all sensors are equipped with cameras. An object of interest moves around the network and the...
156
click to vote
ROBOCOMM
2007
IEEE
16 years 9 days ago
2007
IEEE
—This paper presents a communication/coordination/ processing architecture for distributed adaptive observation of a spatial field using a fleet of autonomous mobile sensors. O...