3874 search results - page 241 / 775 » Approximation Algorithms for k-hurdle Problems |
137
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
A problem of planning for cooperative teams under uncertainty is a crucial one in multiagent systems. Decentralized partially observable Markov decision processes (DECPOMDPs) prov...
160
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
158
click to vote
HYBRID
2000
Springer
15 years 7 months ago
2000
Springer
In this paper we describe an experimental system called d=dt for approximating reachable states for hybrid systems whose continuous dynamics is de ned by linear di erential equatio...
147
click to vote
ADHOCNOW
2005
Springer
15 years 9 months ago
2005
Springer
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...
148
click to vote
ESA
2008
Springer
15 years 6 months ago
2008
Springer
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pa...