Sciweavers

5866 search results - page 319 / 1174
» An e-Process Selection Model
Sort
View
MP
2002
143views more  MP 2002»
15 years 6 months ago
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
François Vanderbeck
EMNLP
2010
15 years 4 months ago
What a Parser Can Learn from a Semantic Role Labeler and Vice Versa
In many NLP systems, there is a unidirectional flow of information in which a parser supplies input to a semantic role labeler. In this paper, we build a system that allows inform...
Stephen A. Boxwell, Dennis Mehay, Chris Brew
PPSN
2004
Springer
15 years 12 months ago
Ensemble Learning with Evolutionary Computation: Application to Feature Ranking
Abstract. Exploiting the diversity of hypotheses produced by evolutionary learning, a new ensemble approach for Feature Selection is presented, aggregating the feature rankings ext...
Kees Jong, Elena Marchiori, Michèle Sebag
MASCOTS
2004
15 years 8 months ago
Simulating Internet Worms
The accurate and efficient modeling of Internet worms is a particularly challenging task for network simulation tools. The atypical and aggressive behavior of these worms can easi...
George F. Riley, Monirul I. Sharif, Wenke Lee
JOT
2007
99views more  JOT 2007»
15 years 6 months ago
On the Footprints of Join Points: The Blueprint Approach
nt selection mechanism at a high-level of abstraction to decouple aspects from the application code. To this regard, we adopt a high-level pattern-based join point model, where joi...
Walter Cazzola, Sonia Pini