1224 search results - page 113 / 245 » Theory decision by decomposition |
102
Voted
AUTOMATICA
2006
15 years 25 days ago
2006
While risk-sensitive (RS) approaches for designing plans of total productive maintenance are critical in manufacturing systems, there is little in the literature by way of theoret...
163
Voted
AGENTS
2001
Springer
15 years 5 months ago
2001
Springer
In this paper, we investigate the use of hierarchical reinforcement learning (HRL) to speed up the acquisition of cooperative multi-agent tasks. We introduce a hierarchical multi-a...
115
Voted
STOC
2006
ACM
16 years 1 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
135
Voted
ATAL
2011
Springer
14 years 22 days ago
2011
Springer
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...
106
click to vote
DAC
2003
ACM
16 years 1 months ago
2003
ACM
This paper addresses the problem of extending the lifetime of a batterypowered mobile host in a client-server wireless network by using task migration and remote processing. This ...