4255 search results - page 143 / 851 » Cover |
164
click to vote
MFCS
2009
Springer
15 years 9 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
165
click to vote
AGENTS
2001
Springer
15 years 9 months ago
2001
Springer
In this paper, we study a simple means for coordinating teams of simple agents. In particular, we study ant robots and how they can cover terrain once or repeatedly by leaving mar...
131
click to vote
COLT
2000
Springer
15 years 8 months ago
2000
Springer
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and...
151
click to vote
ISD
1999
Springer
15 years 8 months ago
1999
Springer
One of the primary methods of studying change in the natural and man-made environment is that of comparison of multi-date maps and images of the earth's surface. Such comparis...
132
click to vote
ICLP
1997
Springer
15 years 8 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...