Sciweavers

7930 search results - page 674 / 1586
» Greedy in Approximation Algorithms
Sort
View
INFOCOM
2007
IEEE
16 years 1 months ago
Optimal Pricing in a Free Market Wireless Network
We consider an ad-hoc wireless network operating within a free market economic model. Users send data over a choice of paths, and scheduling and routing decisions are updated dyna...
Michael J. Neely
ICANN
2007
Springer
16 years 1 months ago
Selection of Decision Stumps in Bagging Ensembles
Abstract. This article presents a comprehensive study of different ensemble pruning techniques applied to a bagging ensemble composed of decision stumps. Six different ensemble p...
Gonzalo Martínez-Muñoz, Daniel Hern&...
AICT
2006
IEEE
16 years 1 months ago
Optimal Solution of the Maximum All Request Path Grooming Problem
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
Jean-Claude Bermond, Michel Cosnard, David Coudert...
GLOBECOM
2006
IEEE
16 years 1 months ago
Optimized Transmission for Upstream Vectored DSL Systems Using Zero-Forcing Generalized Decision-Feedback Equalizers
— In upstream vectored DSL transmission, the far-end crosstalk (FEXT) can be completely cancelled by using zeroforcing generalized decision-feedback equalizers (ZF-GDFE). When th...
Chiang-Yu Chen, Kibeom Seong, Rui Zhang, John M. C...
INFOCOM
2005
IEEE
16 years 28 days ago
GLIDER: gradient landmark-based distributed routing for sensor networks
— We present Gradient Landmark-Based Distributed Routing (GLIDER), a novel naming/addressing scheme and associated routing algorithm, for a network of wireless communicating node...
Qing Fang, Jie Gao, Leonidas J. Guibas, V. de Silv...