1159 search results - page 73 / 232 » On The Next Move in Programming |
114
click to vote
COMPGEOM
2008
ACM
15 years 2 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
125
Voted
JFR
2007
15 years 13 days ago
2007
To achieve the ever increasing demand for science return, planetary exploration rovers require more autonomy to successfully perform their missions. Indeed, the communication dela...
133
click to vote
VTC
2010
IEEE
14 years 11 months ago
2010
IEEE
—In wireless sensor networks (WSN), stochastic node dropping and unpredictable node failure greatly impair coverage, creating sensing holes, while locally redundant sensors exist...
124
click to vote
IPL
2010
14 years 7 months ago
2010
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...
100
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...