Sciweavers

791 search results - page 134 / 159
» Approximating the Maximum Sharing Problem
Sort
View
JCAM
2010
116views more  JCAM 2010»
13 years 2 months ago
A vertex-based hierarchical slope limiter for p-adaptive discontinuous Galerkin methods
A new approach to slope limiting for discontinuous Galerkin methods on arbitrary meshes is introduced. A local Taylor basis is employed to express the approximate solution in term...
Dmitri Kuzmin
GLOBECOM
2009
IEEE
14 years 2 months ago
A Suboptimal Network Utility Maximization Approach for Scalable Multimedia Applications
—Wired and wireless data networks have witnessed an explosive growth of inelastic traffics such as real-time or media streaming applications. Recently, applications relying on l...
Mohammad Sadegh Talebi, Ahmad Khonsari, Mohammad H...
ESA
2006
Springer
111views Algorithms» more  ESA 2006»
13 years 11 months ago
Path Hitting in Acyclic Graphs
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
Ojas Parekh, Danny Segev
TSMC
2008
146views more  TSMC 2008»
13 years 7 months ago
Decentralized Learning in Markov Games
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is tha...
Peter Vrancx, Katja Verbeeck, Ann Nowé
ATAL
2004
Springer
14 years 1 months ago
Decentralized Markov Decision Processes with Event-Driven Interactions
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
Raphen Becker, Shlomo Zilberstein, Victor R. Lesse...