Sciweavers

782 search results - page 79 / 157
» MB-DPOP: A New Memory-Bounded Algorithm for Distributed Opti...
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 9 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
COLT
1993
Springer
14 years 1 months ago
Learning from a Population of Hypotheses
We introduce a new formal model in which a learning algorithm must combine a collection of potentially poor but statistically independent hypothesis functions in order to approxima...
Michael J. Kearns, H. Sebastian Seung
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
13 years 10 months ago
On-line Randomized Call Control Revisited
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
Stefano Leonardi, Alberto Marchetti-Spaccamela, Al...
COMCOM
2007
145views more  COMCOM 2007»
13 years 8 months ago
Jointly rate and power control in contention based MultiHop Wireless Networks
This paper presents a new algorithm for jointly optimal control of session rate, link attempt rate, and link power in contention based MultiHop Wireless Networks. Formulating the ...
Abdorasoul Ghasemi, Karim Faez
GECCO
2005
Springer
220views Optimization» more  GECCO 2005»
14 years 2 months ago
Scale invariant pareto optimality: a meta--formalism for characterizing and modeling cooperativity in evolutionary systems
This article describes a mathematical framework for characterizing cooperativity in complex systems subject to evolutionary pressures. This framework uses three foundational compo...
Mark Fleischer