Sciweavers

1689 search results - page 244 / 338
» Proximate point searching
Sort
View
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
PDP
2007
IEEE
15 years 10 months ago
Metadata Integration and Media Transcoding in Universal-Plug-and-Play (UPnP) Enabled Networks
Universal Plug and Play (UPnP) is a widely accepted standard for automatically detecting devices and services in a local area network as well as for describing and controlling the...
M. Jakab, Michael Kropfberger, M. Ofner, Roland Tu...
ICALP
2003
Springer
15 years 9 months ago
Similarity Matrices for Pairs of Graphs
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...
Vincent D. Blondel, Paul Van Dooren
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 8 months ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
ECAL
1995
Springer
15 years 7 months ago
Contemporary Evolution Strategies
After an outline of the history of evolutionary algorithms, a new ( ) variant of the evolution strategies is introduced formally. Though not comprising all degrees of freedom, it i...
Hans-Paul Schwefel, Günter Rudolph