2040 search results - page 123 / 408 » Approximate Expectation Maximization |
131
click to vote
SIAMCOMP
2008
15 years 3 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
125
click to vote
STOC
1992
ACM
15 years 7 months ago
1992
ACM
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
121
Voted
NETWORKS
2008
15 years 3 months ago
2008
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
114
click to vote
AGI
2011
14 years 6 months ago
2011
Abstract. Perfectly rational decision-makers maximize expected utility, but crucially ignore the resource costs incurred when determining optimal actions. Here we employ an axiomat...
128
click to vote
AAAI
2012
13 years 5 months ago
2012
This paper is devoted to sequential decision making with Rank Dependent expected Utility (RDU). This decision criterion generalizes Expected Utility and enables to model a wider r...