Sciweavers

1615 search results - page 211 / 323
» Computer science and decision theory
Sort
View
ATAL
2007
Springer
16 years 1 months ago
A globally optimal algorithm for TTD-MDPs
In this paper, we discuss the use of Targeted Trajectory Distribution Markov Decision Processes (TTD-MDPs)—a variant of MDPs in which the goal is to realize a specified distrib...
Sooraj Bhat, David L. Roberts, Mark J. Nelson, Cha...
ATAL
2011
Springer
14 years 6 months ago
Towards a unifying characterization for quantifying weak coupling in dec-POMDPs
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
Stefan J. Witwicki, Edmund H. Durfee
PODC
2012
ACM
13 years 9 months ago
Brief announcement: a calculus of policy-based routing systems
The BGP (Border Gateway Protocol) is the single inter-domain routing protocol that enables network operators within each autonomous system (AS) to influence routing decisions by ...
Anduo Wang, Carolyn L. Talcott, Alexander J. T. Gu...
TCS
2011
15 years 1 months ago
Communication complexity and intrinsic universality in cellular automata
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...
Eric Goles Chacc, Pierre-Etienne Meunier, Ivan Rap...
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
16 years 7 months ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri