In this paper, the arrival of calls (i.e., new and handoff calls) in a personal communications services (PCS) network is modeled by a Markov arrival process (MAP) in which we allow...
We propose a frameworkfor robot programming which allows the seamless integration of explicit agent programming with decision-theoretic planning. Specifically, the DTGolog model a...
Craig Boutilier, Raymond Reiter, Mikhail Soutchans...
— Structured Peer to Peer (P2P) overlay networks are becoming increasingly popular. Multi-hop systems achieve a successful lookup in O(log N) hops, whereas one-hop systems approa...
Mario Kolberg, Florence Kolberg, Alan Brown, John ...
Max-margin Markov networks (M3 N) have shown great promise in structured prediction and relational learning. Due to the KKT conditions, the M3 N enjoys dual sparsity. However, the...
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...