Sciweavers

143 search results - page 21 / 29
» Combination of Among and Cardinality Constraints
Sort
View
INFOCOM
2007
IEEE
14 years 5 months ago
Using Channel Hopping to Increase 802.11 Resilience to Jamming Attacks
—802.11a, b, and g standards were designed for deployment in cooperative environments, and hence do not include mechanisms to protect from jamming attacks. In this paper, we expl...
Vishnu Navda, Aniruddha Bohra, Samrat Ganguly, Dan...
CP
2007
Springer
14 years 5 months ago
The Log-Support Encoding of CSP into SAT
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
Marco Gavanelli
CP
2007
Springer
14 years 5 months ago
Min-Domain Ordering for Asynchronous Backtracking
Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the mi...
Roie Zivan, Moshe Zazone, Amnon Meisels
ICARIS
2007
Springer
14 years 5 months ago
An Artificial Immune System-Inspired Multiobjective Evolutionary Algorithm with Application to the Detection of Distributed Comp
Today’s signature-based intrusion detection systems are reactive in nature and storage-limited. Their operation depends upon catching an instance of an intrusion or virus and en...
Charles R. Haag, Gary B. Lamont, Paul D. Williams,...
DASFAA
2009
IEEE
108views Database» more  DASFAA 2009»
14 years 2 months ago
An Effective and Efficient Method for Handling Transmission Failures in Sensor Networks
Abstract. The suppression scheme is a solution for limited energy constraints in sensor networks. Temporal suppression, spatial suppression and spatio-temporal suppression are prop...
Heejung Yang, Chin-Wan Chung