Sciweavers

417 search results - page 40 / 84
» Some Theory for Generalized Boosting Algorithms
Sort
View
GECCO
2005
Springer
111views Optimization» more  GECCO 2005»
14 years 2 months ago
XCS with eligibility traces
The development of the XCS Learning Classifier System has produced a robust and stable implementation that performs competitively in direct-reward environments. Although investig...
Jan Drugowitsch, Alwyn Barry
PODC
2009
ACM
14 years 9 months ago
Brief announcement: minimum spanning trees and cone-based topology control
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
Alejandro Cornejo, Nancy A. Lynch
MST
2010
187views more  MST 2010»
13 years 3 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
ICML
2009
IEEE
14 years 9 months ago
Learning with structured sparsity
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
Junzhou Huang, Tong Zhang, Dimitris N. Metaxas
JCT
1998
193views more  JCT 1998»
13 years 8 months ago
Fractional Kernels in Digraphs
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
Ron Aharoni, Ron Holzman