2069 search results - page 305 / 414 » Linear time algorithms for Clobber |
160
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
191
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
189
click to vote
ISSTA
2000
ACM
15 years 11 months ago
2000
ACM
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...
217
click to vote
JCB
2002
15 years 6 months ago
2002
For small samples, classi er design algorithms typically suffer from over tting. Given a set of features, a classi er must be designed and its error estimated. For small samples, ...
169
click to vote
AMAI
2008
Springer
15 years 7 months ago
2008
Springer
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...