3082 search results - page 22 / 617 » New Bounds for the Controller Problem |
156
Voted
COLT
1995
Springer
15 years 7 months ago
1995
Springer
We investigate the problem of estimating the proportion vector which maximizes the likelihood of a given sample for a mixture of given densities. We adapt a framework developed for...
139
click to vote
ENDM
2010
15 years 3 months ago
2010
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
135
Voted
JAL
2006
15 years 3 months ago
2006
In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) wit...
151
Voted
FC
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. Anonymity features of electronic payment systems are important for protecting privacy in an electronic world. However, complete anonymity prevents monitoring financial t...
136
Voted
NIPS
2003
15 years 4 months ago
2003
We describe a new approximation algorithm for solving partially observable MDPs. Our bounded policy iteration approach searches through the space of bounded-size, stochastic fini...