Sciweavers

13214 search results - page 273 / 2643
» Pseudorandomness for network algorithms
Sort
View
ACSAC
2006
IEEE
16 years 23 days ago
Backtracking Algorithmic Complexity Attacks against a NIDS
Network Intrusion Detection Systems (NIDS) have become crucial to securing modern networks. To be effective, a NIDS must be able to counter evasion attempts and operate at or near...
Randy Smith, Cristian Estan, Somesh Jha
SWAT
2004
Springer
120views Algorithms» more  SWAT 2004»
16 years 22 hour ago
Railway Delay Management: Exploring Its Algorithmic Complexity
We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If...
Michael Gatto, Björn Glaus, Riko Jacob, Leon ...
CDC
2009
IEEE
137views Control Systems» more  CDC 2009»
15 years 11 months ago
Asynchronous gossip algorithms for stochastic optimization
Abstract— We consider a distributed multi-agent network system where the goal is to minimize an objective function that can be written as the sum of component functions, each of ...
Sundhar Srinivasan Ram, Angelia Nedic, Venugopal V...
EVOW
2001
Springer
15 years 11 months ago
An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem
Augmenting an existing network with additional links to achieve higher robustness and survivability plays an important role in network design. We consider the problem of augmenting...
Ivana Ljubic, Günther R. Raidl
GECCO
2008
Springer
135views Optimization» more  GECCO 2008»
15 years 7 months ago
iBOA: the incremental bayesian optimization algorithm
This paper proposes the incremental Bayesian optimization algorithm (iBOA), which modifies standard BOA by removing the population of solutions and using incremental updates of t...
Martin Pelikan, Kumara Sastry, David E. Goldberg