2924 search results - page 223 / 585 » Lower Bounds in Distributed Computing |
175
click to vote
JMLR
2012
13 years 6 months ago
2012
Contextual bandit learning is a reinforcement learning problem where the learner repeatedly receives a set of features (context), takes an action and receives a reward based on th...
140
click to vote
SAC
2006
ACM
15 years 9 months ago
2006
ACM
: In chip design, one of the main objectives is to decrease its clock cycle; however, the existing approaches to timing analysis under uncertainty are based on fundamentally restri...
119
click to vote
AMAI
2008
Springer
15 years 4 months ago
2008
Springer
We study distributed boundary coverage of known environments using a team of miniature robots. Distributed boundary coverage is an instance of the multi-robot task-allocation prob...
146
click to vote
IPCCC
2005
IEEE
15 years 9 months ago
2005
IEEE
The Double Authentication (DA) scheme presented in [1] is designed to provide security against impersonation attack to link state routing protocol at a lower computational cost as...
123
click to vote
TPDS
2010
15 years 2 months ago
2010
Abstract—In the past few years, P2P file distribution applications (e.g., BitTorrent) are becoming so popular that they are the dominating source of Internet traffic. This crea...