2252 search results - page 163 / 451 » Lower Bounds for Dynamic Algorithms |
131
click to vote
NIPS
2004
15 years 4 months ago
2004
In the context of binary classification, we define disagreement as a measure of how often two independently-trained models differ in their classification of unlabeled data. We exp...
128
Voted
EUC
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we propose an ant-based algorithm for dynamic routing and wavelength assignment (RWA) in WDM optical networks under the wavelength continuity constraint. By adopting...
133
click to vote
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
118
click to vote
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We investigate the online exploration problem of a shortsighted mobile robot moving in an unknown cellular room without obstacles. The robot has a very limited sensor; it...
117
Voted
MASS
2010
15 years 1 months ago
2010
We study a problem in which a single sensor is scheduled to observe sites periodically, motivated by applications in which the goal is to maintain up-to-date readings for all the o...