1277 search results - page 162 / 256 » Terminating Decision Algorithms Optimally |
173
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
In Grids scheduling decisions are often made on the basis of jobs being either data or computation intensive: in data intensive situations jobs may be pushed to the data and in co...
154
click to vote
AAMAS
2010
Springer
15 years 6 months ago
2010
Springer
Abstract In this paper we address the problem of simultaneous learning and coordination in multiagent Markov decision problems (MMDPs) with infinite state-spaces. We separate this ...
180
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we develop a beamforming algorithm for multiuser MIMO-relaying wireless systems. We consider a relaying scenario with multiple sources transmitting to one or more d...
167
click to vote
GD
2007
Springer
16 years 25 days ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
179
click to vote
SIGECOM
2005
ACM
16 years 6 days ago
2005
ACM
We present the first design for a fully expressive iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language that is concise and expressive ...