Sciweavers

1433 search results - page 100 / 287
» On Covering Problems of Rado
Sort
View
IPPS
2006
IEEE
16 years 11 days ago
A nonself space approach to network anomaly detection
The paper presents an approach for the anomaly detection problem based on principles of immune systems. Flexibility and efficiency of the anomaly detection system are achieved by ...
Marek Ostaszewski, Franciszek Seredynski, Pascal B...
TPHOL
2003
IEEE
15 years 11 months ago
A Coverage Checking Algorithm for LF
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
Carsten Schürmann, Frank Pfenning
GECCO
2006
Springer
145views Optimization» more  GECCO 2006»
15 years 10 months ago
Immune anomaly detection enhanced with evolutionary paradigms
The paper presents an approach based on principles of immune systems to the anomaly detection problem. Flexibility and efficiency of the anomaly detection system are achieved by b...
Marek Ostaszewski, Franciszek Seredynski, Pascal B...
ICMLA
2007
15 years 7 months ago
Phase transition and heuristic search in relational learning
Several works have shown that the covering test in relational learning exhibits a phase transition in its covering probability. It is argued that this phase transition dooms every...
Érick Alphonse, Aomar Osmani
JCO
2006
153views more  JCO 2006»
15 years 6 months ago
Efficient point coverage in wireless sensor networks
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
Jie Wang, Ning Zhong