Sciweavers

2006 search results - page 224 / 402
» Heuristic Security-Testing Methods
Sort
View
RSKT
2009
Springer
15 years 10 months ago
A Time-Reduction Strategy to Feature Selection in Rough Set Theory
In rough set theory, the problem of feature selection aims to retain the discriminatory power of original features. Many feature selection algorithms have been proposed, however, q...
Hongxing Chen, Yuhua Qian, Jiye Liang, Wei Wei, Fe...
AIIA
2001
Springer
15 years 10 months ago
Wide Coverage Incremental Parsing by Learning Attachment Preferences
This paper presents a novel method for wide coverage parsing using an incremental strategy, which is psycholinguistically motivated. A recursive neural network is trained on treeba...
Fabrizio Costa, Vincenzo Lombardo, Paolo Frasconi,...
CP
2001
Springer
15 years 10 months ago
Collaborative Learning for Constraint Solving
Abstract. Although constraint programming offers a wealth of strong, generalpurpose methods, in practice a complex, real application demands a person who selects, combines, and ref...
Susan L. Epstein, Eugene C. Freuder
176
Voted
IWQOS
2001
Springer
15 years 10 months ago
JoBS: Joint Buffer Management and Scheduling for Differentiated Services
A novel algorithm for buffer management and packet scheduling is presented for providing loss and delay differentiation for traffic classes at a network router. The algorithm, cal...
Jörg Liebeherr, Nicolas Christin
WADS
2001
Springer
143views Algorithms» more  WADS 2001»
15 years 10 months ago
An Approach for Mixed Upward Planarization
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
Markus Eiglsperger, Michael Kaufmann