Sciweavers

1566 search results - page 119 / 314
» On a Cone Covering Problem
Sort
View
MP
1998
105views more  MP 1998»
15 years 6 months ago
Capacitated facility location: Separation algorithms and computational experience
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
Karen Aardal

Book
357views
17 years 4 months ago
Foundations of Constraint Satisfaction
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
Edward Tsang
IPPS
2006
IEEE
16 years 13 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...