Sciweavers

4208 search results - page 713 / 842
» Challenges in Evaluating Distributed Algorithms
Sort
View
KDD
2004
ACM
135views Data Mining» more  KDD 2004»
14 years 10 months ago
Discovering additive structure in black box functions
Many automated learning procedures lack interpretability, operating effectively as a black box: providing a prediction tool but no explanation of the underlying dynamics that driv...
Giles Hooker
KDD
2001
ACM
142views Data Mining» more  KDD 2001»
14 years 10 months ago
TreeDT: gene mapping by tree disequilibrium test
We introduce and evaluate TreeDT, a novel gene mapping method which is based on discovering and assessing tree-like patterns in genetic marker data. Gene mapping aims at discoveri...
Petteri Sevon, Hannu Toivonen, Vesa Ollikainen
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 3 months ago
SDR: a better trigger for adaptive variance scaling in normal EDAs
Recently, advances have been made in continuous, normal– distribution–based Estimation–of–Distribution Algorithms (EDAs) by scaling the variance up from the maximum–like...
Peter A. N. Bosman, Jörn Grahl, Franz Rothlau...
IPSN
2007
Springer
14 years 3 months ago
Beacon location service: a location service for point-to-point routing in wireless sensor networks
In this paper we present Beacon Location Service (BLS): a location service for beacon-based routing algorithms like Beacon Vector Routing (BVR) [8] and S4 [19] . The role of a loc...
Jorge Ortiz, Chris R. Baker, Daekyeong Moon, Rodri...
CIKM
2004
Springer
14 years 3 months ago
Composable XML integration grammars
The proliferation of XML as a standard for data representation and exchange in diverse, next-generation Web applications has created an emphatic need for effective XML data-integr...
Wenfei Fan, Minos N. Garofalakis, Ming Xiong, Xibe...