Sciweavers

868 search results - page 27 / 174
» Finding Most Likely Solutions
Sort
View
EOR
2010
116views more  EOR 2010»
13 years 7 months ago
Speeding up continuous GRASP
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
Michael J. Hirsch, Panos M. Pardalos, Mauricio G. ...
AIPS
2006
13 years 9 months ago
Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
Mark F. Rogers, Adele E. Howe, Darrell Whitley
ICDCS
2006
IEEE
14 years 1 months ago
A DoS Resilient Flow-level Intrusion Detection Approach for High-speed Networks
Global-scale attacks like viruses and worms are increasing in frequency, severity and sophistication, making it critical to detect outbursts at routers/gateways instead of end hos...
Yan Gao, Zhichun Li, Yan Chen
ICDE
2010
IEEE
750views Database» more  ICDE 2010»
14 years 6 hour ago
Efficient and accurate discovery of patterns in sequence datasets
Existing sequence mining algorithms mostly focus on mining for subsequences. However, a large class of applications, such as biological DNA and protein motif mining, require effici...
Avrilia Floratou, Sandeep Tata, Jignesh M. Patel
IH
2010
Springer
13 years 5 months ago
The Reverse Statistical Disclosure Attack
Abstract. Statistical disclosure is a well-studied technique that an attacker can use to uncover relations between users in mix-based anonymity systems. Prior work has focused on f...
Nayantara Mallesh, Matthew K. Wright