Sciweavers

2006 search results - page 121 / 402
» Heuristic Security-Testing Methods
Sort
View
CORR
2008
Springer
153views Education» more  CORR 2008»
15 years 2 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...
COR
2006
118views more  COR 2006»
15 years 2 months ago
Accelerating column generation for aircraft scheduling using constraint propagation
We discuss how constraint programming can improve the performance of a column generation solution process for the NP-hard Tail Assignment problem in aircraft scheduling. Combining...
Mattias Grönkvist
COMCOM
2007
111views more  COMCOM 2007»
15 years 2 months ago
An argument for simple embedded ACL optimisation
The difficulty of efficiently reordering the rules in an Access Control List is considered and the essential optimisation problem formulated. The complexity of exact and sophistic...
Vic Grout, John Davies, John McGinn
CSDA
2007
109views more  CSDA 2007»
15 years 2 months ago
Improving the computation of censored quantile regressions
Abstract. Censored quantile regressions (CQR) are a valuable tool in economics and engineering. The computation of estimators is highly complex and the performance of standard meth...
Bernd Fitzenberger, Peter Winker
PR
2006
161views more  PR 2006»
15 years 2 months ago
Incremental wrapper-based gene selection from microarray data for cancer classification
Gene expression microarray is a rapidly maturing technology that provides the opportunity to assay the expression levels of thousands or tens of thousands of genes in a single exp...
Roberto Ruiz Sánchez, José Crist&oac...