Sciweavers

2412 search results - page 155 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
CP
2001
Springer
15 years 8 months ago
Random 3-SAT and BDDs: The Plot Thickens Further
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
Alfonso San Miguel Aguirre, Moshe Y. Vardi
114
Voted
MANSCI
2008
96views more  MANSCI 2008»
15 years 3 months ago
Staffing of Time-Varying Queues to Achieve Time-Stable Performance
Continuing research by Jennings, Mandelbaum, Massey and Whitt (1996), we investigate methods to perform time-dependent staffing for many-server queues. Our aim is to achieve time-...
Zohar Feldman, Avishai Mandelbaum, William A. Mass...
PODS
2008
ACM
109views Database» more  PODS 2008»
16 years 3 months ago
Time-decaying aggregates in out-of-order streams
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
Graham Cormode, Flip Korn, Srikanta Tirthapura
ICC
2008
IEEE
134views Communications» more  ICC 2008»
15 years 10 months ago
Secret Little Functions and Codebook for Protecting Users from Password Theft
—In this paper, we discuss how to prevent users’ passwords from being stolen by adversaries. We propose differentiated security mechanisms in which a user has the freedom to ch...
Yang Xiao, Chung-Chih Li, Ming Lei, Susan V. Vrbsk...
82
Voted
KBS
2007
75views more  KBS 2007»
15 years 3 months ago
Managing restaurant tables using constraints
Restaurant table management can have significant impact on both profitability and the customer experience. The core of the issue is a complex dynamic combinatorial problem. We sho...
Alfio Vidotto, Kenneth N. Brown, J. Christopher Be...