2080 search results - page 30 / 416 » Measuring empirical computational complexity |
SRDS
2008
IEEE
14 years 4 months ago
2008
IEEE
We present an empirical study of the resistance of several protocols to denial of service (DoS) attacks on client-server communication. We show that protocols that use authenticat...
HUC
2007
Springer
14 years 4 months ago
2007
Springer
This article investigates the conflicting area of user benefits arising through item level RFID tagging and a desire for privacy. It distinguishes between three approaches feasible...
CCS
2010
ACM
13 years 10 months ago
2010
ACM
This paper presents the first large-scale study of the success of password expiration in meeting its intended purpose, namely revoking access to an account by an attacker who has ...
SYSTOR
2010
ACM
13 years 10 months ago
2010
ACM
A basic problem in the management of web servers is capacity planning: you want enough capacity to be able to serve peak loads, but not too much so as to avoid excessive costs. It...
GECCO
2004
Springer
14 years 3 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...