Sciweavers

15375 search results - page 2685 / 3075
» cans 2008
Sort
View
APNOMS
2008
Springer
15 years 9 months ago
Application of Data Mining to Network Intrusion Detection: Classifier Selection Model
As network attacks have increased in number and severity over the past few years, intrusion detection system (IDS) is increasingly becoming a critical component to secure the netwo...
Huy Anh Nguyen, Deokjai Choi
APPROX
2008
Springer
190views Algorithms» more  APPROX 2008»
15 years 9 months ago
The Complexity of Local List Decoding
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
Dan Gutfreund, Guy N. Rothblum
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
15 years 9 months ago
A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem
A long-standing conjecture in Combinatorial Optimization is that the integrality gap of the Held-Karp LP relaxation for the Asymmetric Traveling Salesman Problem (ATSP) is a consta...
Thành Nguyen
APSEC
2008
IEEE
15 years 9 months ago
Emergent Properties in Reactive Systems
Reactive systems are often described by interconnecting sub-components along architectural connectors defining communication policies. Generally, such global systems may exhibit p...
Marc Aiguier, Pascale Le Gall, Mbarka Mabrouki
ARCS
2008
Springer
15 years 9 months ago
How Efficient are Creatures with Time-shuffled Behaviors?
: The task of the creatures in the "creatures' exploration problem" is to visit all empty cells in an environment with a minimum number of steps. We have analyzed th...
Patrick Ediger, Rolf Hoffmann, Mathias Halbach
« Prev « First page 2685 / 3075 Last » Next »