791 search results - page 134 / 159 » Approximating the Maximum Sharing Problem |
139
click to vote
JCAM
2010
14 years 9 months ago
2010
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...
131
click to vote
GLOBECOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—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...
118
click to vote
ESA
2006
Springer
15 years 6 months ago
2006
Springer
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...
121
click to vote
TSMC
2008
15 years 2 months ago
2008
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...
114
click to vote
ATAL
2004
Springer
15 years 8 months ago
2004
Springer
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...