Sciweavers

2027 search results - page 83 / 406
» When is it best to best-respond
Sort
View
81
Voted
ICCCN
2007
IEEE
15 years 7 months ago
A Fast Delivery Protocol for Total Order Broadcasting
Abstract—Sequencer, privilege-based, and communication history algorithms are popular approaches to implement total ordering, where communication history algorithms are most suit...
Li Ou, Xubin He, Christian Engelmann, Stephen L. S...
124
Voted
PERCOM
2007
ACM
15 years 7 months ago
An Adaptive Algorithm for Fault Tolerant Re-Routing in Wireless Sensor Networks
A substantial amount of research on routing in sensor networks has focused upon methods for constructing the best route, or routes, from data source to sink before sending the dat...
Michael Gregoire, Israel Koren
QSIC
2007
IEEE
15 years 7 months ago
Model Checking Security Pattern Compositions
Security patterns capture best practice on secure software design and development. They document typical solutions to security problems. To ensure security, large software system ...
Jing Dong, Tu Peng, Yajing Zhao
COCO
2007
Springer
87views Algorithms» more  COCO 2007»
15 years 7 months ago
Parity Problems in Planar Graphs
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
Mark Braverman, Raghav Kulkarni, Sambuddha Roy
81
Voted
COLT
2007
Springer
15 years 7 months ago
Strategies for Prediction Under Imperfect Monitoring
Abstract. We propose simple randomized strategies for sequential prediction under imperfect monitoring, that is, when the forecaster does not have access to the past outcomes but r...
Gábor Lugosi, Shie Mannor, Gilles Stoltz