223 search results - page 40 / 45 » Proving Termination by Bounded Increase |
ICRA
2010
IEEE
14 years 8 months ago
2010
IEEE
— This paper is concerned with determining whether a mobile robot, called the pursuer, is up to maintaining visibility of an antagonist agent, called the evader. This problem, a ...
CORR
2010
Springer
14 years 6 months ago
2010
Springer
Online prediction methods are typically presented as serial algorithms running on a single processor. However, in the age of web-scale prediction problems, it is increasingly comm...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
— We consider the decentralized binary hypothesis testing problem on trees of bounded degree and increasing depth. For a regular tree of depth t and branching factor k ≥ 2, we ...
ICDCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Though plenty of research has been conducted to improve Internet P2P streaming quality perceived by endusers, little has been known about the upper bounds of achievable performanc...
SPAA
2004
ACM
15 years 2 months ago
2004
ACM
A key capability of data-race detectors is to determine whether one thread executes logically in parallel with another or whether the threads must operate in series. This paper pr...