Sciweavers

393 search results - page 35 / 79
» On the Convergence of Boosting Procedures
Sort
View
CCS
2005
ACM
14 years 2 months ago
Deciding security of protocols against off-line guessing attacks
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
Mathieu Baudet
SIAMJO
2002
124views more  SIAMJO 2002»
13 years 8 months ago
The Sample Average Approximation Method for Stochastic Discrete Optimization
In this paper we study a Monte Carlo simulation based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and...
Anton J. Kleywegt, Alexander Shapiro, Tito Homem-d...
ICNP
2007
IEEE
14 years 3 months ago
A Game Theoretic Framework of Distributed Power and Rate Control in IEEE 802.11 WLANs
—We present a game-theoretic study on the power and rate control problem in IEEE 802.11 WLANs where network participants choose appropriate transmission power and data rate to ac...
Lin Chen, Jean Leneutre
RTA
2010
Springer
14 years 16 days ago
Infinitary Rewriting: Foundations Revisited
Infinitary Term Rewriting allows to express infinitary terms and infinitary reductions that converge to them. As their notion of transfinite reduction in general, and as binary...
Stefan Kahrs
DEDS
2000
106views more  DEDS 2000»
13 years 8 months ago
Simulation Budget Allocation for Further Enhancing the Efficiency of Ordinal Optimization
Abstract. Ordinal Optimization has emerged as an efficient technique for simulation and optimization. Exponential convergence rates can be achieved in many cases. In this paper, we...
Chun-Hung Chen, Jianwu Lin, Enver Yücesan, St...