Sciweavers

2905 search results - page 423 / 581
» Formal Memetic Algorithms
Sort
View
KCAP
2011
ACM
14 years 6 months ago
Eliciting hierarchical structures from enumerative structures for ontology learning
Some discourse structures such as enumerative structures have typographical, punctuational and laying out characteristics which (1) make them easily identifiable and (2) convey hi...
Mouna Kamel, Bernard Rothenburger
122
Voted
CORR
2007
Springer
126views Education» more  CORR 2007»
15 years 3 months ago
Dial a Ride from k-forest
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath ...
GIS
2005
ACM
16 years 4 months ago
Contraflow network reconfiguration for evacuation planning: a summary of results
Contraflow, or lane reversal, is a way of increasing outbound capacity of a real network by reversing the direction of inbound roads during evacuations. The contraflow is consider...
Sangho Kim, Shashi Shekhar
WWW
2004
ACM
16 years 4 months ago
Newsjunkie: providing personalized newsfeeds via analysis of information novelty
We present a principled methodology for filtering news stories by formal measures of information novelty, and show how the techniques can be used to custom-tailor newsfeeds based ...
Evgeniy Gabrilovich, Susan T. Dumais, Eric Horvitz
146
Voted
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 4 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen