Sciweavers

4843 search results - page 783 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
124
Voted
CCS
2006
ACM
15 years 7 months ago
Evading network anomaly detection systems: formal reasoning and practical techniques
Attackers often try to evade an intrusion detection system (IDS) when launching their attacks. There have been several published studies in evasion attacks, some with available to...
Prahlad Fogla, Wenke Lee
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
15 years 7 months ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...
139
Voted
COMPGEOM
2005
ACM
15 years 5 months ago
On the exact computation of the topology of real algebraic curves
We consider the problem of computing a representation of the plane graph induced by one (or more) algebraic curves in the real plane. We make no assumptions about the curves, in p...
Raimund Seidel, Nicola Wolpert
134
Voted
NIPS
1996
15 years 4 months ago
Reinforcement Learning for Dynamic Channel Allocation in Cellular Telephone Systems
In cellular telephone systems, an important problem is to dynamically allocate the communication resource channels so as to maximize service in a stochastic caller environment. Th...
Satinder P. Singh, Dimitri P. Bertsekas
118
Voted
4OR
2010
137views more  4OR 2010»
15 years 3 months ago
Extended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
Michele Conforti, Gérard Cornuéjols,...