Sciweavers

106 search results - page 17 / 22
» Proving Lower Bounds Via Pseudo-random Generators
Sort
View
FIW
2003
115views Communications» more  FIW 2003»
13 years 8 months ago
Generalising Feature Interactions in Email
We report on a property-based approach to feature interaction analysis for a client-server email system. The model is based upon Hall’s email model [12] presented at FIW’00 [3]...
Muffy Calder, Alice Miller
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 8 months ago
Intrinsic robustness of the price of anarchy
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
Tim Roughgarden
ICALP
2003
Springer
14 years 21 days ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper
COLT
2010
Springer
13 years 5 months ago
Open Loop Optimistic Planning
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...
Sébastien Bubeck, Rémi Munos
CCS
2003
ACM
14 years 21 days ago
Cryptographic tamper evidence
We propose a new notion of cryptographic tamper evidence. A tamper-evident signature scheme provides an additional procedure Div which detects tampering: given two signatures, Div...
Gene Itkis