1456 search results - page 163 / 292 » Improved Randomized Results for That Interval Selection Prob... |
ATAL
2007
Springer
15 years 5 months ago
2007
Springer
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
FOCS
2007
IEEE
15 years 5 months ago
2007
IEEE
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
114
click to vote
ATAL
2007
Springer
15 years 5 months ago
2007
Springer
Over the past few years, swarm based systems have emerged as an attractive paradigm for building large scale distributed systems composed of numerous independent but coordinating ...
STOC
2009
ACM
15 years 11 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
PEPM
1994
ACM
15 years 3 months ago
1994
ACM
Abstract. Selective eta-expansion is a powerful "binding-time improvement", i.e., a sourceprogram modification that makes a partial evaluator yield better results. But li...