Sciweavers

312 search results - page 52 / 63
» On k-optimal distributed constraint optimization algorithms:...
Sort
View
AAAI
2008
13 years 11 months ago
Towards Faster Planning with Continuous Resources in Stochastic Domains
Agents often have to construct plans that obey resource limits for continuous resources whose consumption can only be characterized by probability distributions. While Markov Deci...
Janusz Marecki, Milind Tambe
ATAL
2011
Springer
12 years 8 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe
CDC
2008
IEEE
197views Control Systems» more  CDC 2008»
14 years 3 months ago
Dynamic spectrum access policies for cognitive radio
—We study the problem of dynamic spectrum sensing and access in cognitive radio systems as a partially observed Markov decision process (POMDP). A group of cognitive users cooper...
Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli
INFOCOM
2010
IEEE
13 years 7 months ago
Value-aware Resource Allocation for Service Guarantees in Networks
—The traditional formulation of the total value of information transfer is a multi-commodity flow problem. Here, each data source is seen as generating a commodity along a fixe...
Parimal Parag, Srinivas Shakkottai, Jean-Fran&cced...
DC
2007
13 years 8 months ago
The overhead of consensus failure recovery
Abstract Many reliable distributed systems are consensusbased and typically operate under two modes: a fast normal mode in failure-free synchronous periods, and a slower recovery m...
Partha Dutta, Rachid Guerraoui, Idit Keidar