Sciweavers

1254 search results - page 20 / 251
» Making Hard Problems Harder
Sort
View
HICSS
2000
IEEE
153views Biometrics» more  HICSS 2000»
14 years 1 days ago
On Verifying Distributed Multithreaded Java Programs
Distributed multithreaded software systems are becoming more and more important in modern networked environment. For these systems, concurrency control and thread synchronization ...
Jessica Chen
AAAI
2000
13 years 9 months ago
Redundancy in Random SAT Formulas
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
Yacine Boufkhad, Olivier Roussel
CN
2007
137views more  CN 2007»
13 years 7 months ago
Defending against hitlist worms using network address space randomization
Worms are self-replicating malicious programs that represent a major security threat for the Internet, as they can infect and damage a large number of vulnerable hosts at timescal...
Spyros Antonatos, Periklis Akritidis, Evangelos P....
CIKM
2010
Springer
13 years 6 months ago
Finding unusual review patterns using unexpected rules
In recent years, opinion mining attracted a great deal of research attention. However, limited work has been done on detecting opinion spam (or fake reviews). The problem is analo...
Nitin Jindal, Bing Liu, Ee-Peng Lim
KR
2004
Springer
14 years 1 months ago
An Improved Integer Local Search for Complex Scheduling Problems
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
Weixiong Zhang, Xiaotao Zhang