Sciweavers

666 search results - page 65 / 134
» The Pipelined Set Cover Problem
Sort
View
NDSS
2009
IEEE
14 years 4 months ago
Coordinated Scan Detection
Coordinated attacks, where the tasks involved in an attack are distributed amongst multiple sources, can be used by an adversary to obfuscate his incursion. In this paper we prese...
Carrie Gates
GECCO
2009
Springer
110views Optimization» more  GECCO 2009»
14 years 2 months ago
EMO shines a light on the holes of complexity space
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
Núria Macià, Albert Orriols-Puig, Es...
FOCS
2008
IEEE
14 years 4 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
IJWIN
2006
209views more  IJWIN 2006»
13 years 10 months ago
On Connected Multiple Point Coverage in Wireless Sensor Networks
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
Shuhui Yang, Fei Dai, Mihaela Cardei, Jie Wu, Floy...
SIGSOFT
2008
ACM
14 years 11 months ago
Towards compositional synthesis of evolving systems
Synthesis of system configurations from a given set of features is an important and very challenging problem. This paper makes a step towards this goal by describing an efficient ...
Shiva Nejati, Mehrdad Sabetzadeh, Marsha Chechik, ...