Sciweavers

222 search results - page 43 / 45
» Approximation Algorithms for the Job Interval Selection Prob...
Sort
View
TWC
2010
13 years 2 months ago
Toward network coding-based protocols for data broadcasting in wireless Ad Hoc networks
In this paper we consider practical dissemination algorithms exploiting network coding for data broadcasting in ad hoc wireless networks. For an efcient design, we analyze issues r...
Alfred Asterjadhi, Elena Fasolo, Michele Rossi, J&...
ATAL
2008
Springer
13 years 9 months ago
Autonomous transfer for reinforcement learning
Recent work in transfer learning has succeeded in making reinforcement learning algorithms more efficient by incorporating knowledge from previous tasks. However, such methods typ...
Matthew E. Taylor, Gregory Kuhlmann, Peter Stone
WAOA
2010
Springer
236views Algorithms» more  WAOA 2010»
13 years 5 months ago
The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers
We study an extension of the unit-demand pricing problem in which the seller may offer bundles of items. If a customer buys such a bundle she is guaranteed to get one item out of i...
Patrick Briest, Heiko Röglin
ISMIS
2009
Springer
14 years 2 months ago
Fuzzy Clustering for Categorical Spaces
Abstract. A multi-relational clustering method is presented which can be applied to complex knowledge bases storing resources expressed in the standard Semantic Web languages. It a...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
13 years 11 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla