14078 search results - page 406 / 2816 » Design and Analysis of Computer Algorithms |
227
click to vote
OPODIS
2003
15 years 8 months ago
2003
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
202
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
We present and empirically analyze a machine-learning approach for detecting intrusions on individual computers. Our Winnowbased algorithm continually monitors user and system beh...
197
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
232
click to vote
TSE
2010
15 years 1 months ago
2010
Genetic algorithms (GAs) have been applied previously to UML-driven, stress test requirements generation with the aim of increasing chances of discovering faults relating to networ...
211
click to vote
IWCMC
2010
ACM
15 years 8 months ago
2010
ACM
In a pervasive computing environment, the devices are embedded in the physical world, providing services and interconnected by a communication network. Composition of these servic...