Sciweavers

1511 search results - page 170 / 303
» On the effectiveness of address-space randomization
Sort
View
DSN
2005
IEEE
14 years 1 months ago
Coverage and the Use of Cyclic Redundancy Codes in Ultra-Dependable Systems
A Cyclic Redundancy Code (CRC), when used properly, can be an effective and relatively inexpensive method to detect data corruption across communication channels. However, some sy...
Michael Paulitsch, Jennifer Morris, Brendan Hall, ...
ENC
2005
IEEE
14 years 1 months ago
Saving Evaluations in Differential Evolution for Constrained Optimization
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...
Efrén Mezura-Montes, Carlos A. Coello Coell...
VLDB
2004
ACM
134views Database» more  VLDB 2004»
14 years 1 months ago
Memory-Limited Execution of Windowed Stream Joins
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
Utkarsh Srivastava, Jennifer Widom
INFOCOM
2003
IEEE
14 years 1 months ago
User-Level Performance of Channel-Aware Scheduling Algorithms in Wireless Data Networks
— Channel-aware scheduling strategies, such as the Proportional Fair algorithm for the CDMA 1xEV-DO system, provide an effective mechanism for improving throughput performance in...
Sem C. Borst
INFOCOM
2003
IEEE
14 years 1 months ago
Modeling the Spread of Active Worms
— Active worms spread in an automated fashion and can flood the Internet in a very short time. Modeling the spread of active worms can help us understand how active worms spread...
Zesheng Chen, Lixin Gao, Kevin A. Kwiat