3875 search results - page 119 / 775 » Approximation algorithms for the 0-extension problem |
157
Voted
UAI
1998
15 years 5 months ago
1998
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
121
click to vote
SIGECOM
2006
ACM
15 years 10 months ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
165
click to vote
PODS
2007
ACM
16 years 4 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
176
click to vote
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
128
click to vote
CIAC
2010
Springer
15 years 9 months ago
2010
Springer
A weighted sequence is a string in which a set of characters may appear at each position with respective probabilities of occurrence. A common task is to locate a given motif in a ...