Sciweavers

3823 search results - page 164 / 765
» Experiments with Random Projection
Sort
View
ESA
2004
Springer
96views Algorithms» more  ESA 2004»
15 years 11 months ago
An Experimental Study of Random Knapsack Problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
René Beier, Berthold Vöcking
CP
2000
Springer
15 years 10 months ago
Random 3-SAT: The Plot Thickens
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
Cristian Coarfa, Demetrios D. Demopoulos, Alfonso ...
AOSD
2007
ACM
15 years 10 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
ALENEX
2003
137views Algorithms» more  ALENEX 2003»
15 years 7 months ago
The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...
Christos Gkantsidis, Milena Mihail, Ellen W. Zegur...
CN
2007
137views more  CN 2007»
15 years 6 months ago
Defending against hitlist worms using network address space randomization
Worms are self-replicating malicious programs that represent a major security threat for the Internet, as they can infect and damage a large number of vulnerable hosts at timescal...
Spyros Antonatos, Periklis Akritidis, Evangelos P....