Sciweavers

1464 search results - page 45 / 293
» On optimal anonymization for l -diversity
Sort
View
LCN
2006
IEEE
15 years 5 months ago
Minimizing Cache Misses in an Event-driven Network Server: A Case Study of TUX
We analyze the performance of CPU-bound network servers and demonstrate experimentally that the degradation in the performance of these servers under highconcurrency workloads is ...
Sapan Bhatia, Charles Consel, Julia L. Lawall
WPES
2005
ACM
15 years 5 months ago
The privacy cost of the second-chance offer
This paper examines a generalization of a two-stage game common on eBay: an ascending-price auction followed by price discrimination (the second chance offer). High bids in the a...
Sumit Joshi, Yu-An Sun, Poorvi L. Vora
TCOM
2011
86views more  TCOM 2011»
14 years 6 months ago
New Bounds and Optimal Binary Signature Sets - Part I: Periodic Total Squared Correlation
—We derive new bounds on the periodic (cyclic) total squared correlation (PTSC) of binary antipodal signature sets for any number of signatures K and any signature length L. Opti...
Harish Ganapathy, Dimitrios A. Pados, George N. Ka...
GECCO
2004
Springer
109views Optimization» more  GECCO 2004»
15 years 5 months ago
Development of a Genetic Algorithm for Optimization of Nanoalloys
A genetic algorithm has been developed in order to find the global minimum of platinum-palladium nanoalloy clusters. The effect of biasing the initial population and predating sp...
Lesley D. Lloyd, Roy L. Johnston, Said Salhi
JC
2002
63views more  JC 2002»
14 years 11 months ago
On the Complexity of Exclusion Algorithms for Optimization
Exclusion algorithms are a well-known tool in the area of interval analysis for finding all solutions of a system of nonlinear equations or for finding the global minimum of a fun...
Eugene L. Allgower, Melissa Erdmann, Kurt Georg