7150 search results - page 414 / 1430 » An Approximation Algorithm for Approximation Rank |
188
click to vote
FSTTCS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
191
click to vote
AIPS
2008
15 years 9 months ago
2008
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
168
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Optimum implementation of non-conventional wells allows us to increase considerably hydrocarbon recovery. By considering the high drilling cost and the potential improvement in we...
171
click to vote
TKDE
2010
15 years 5 months ago
2010
—Duplicates in data streams may often be observed by the projection on a subspace and/or multiple recordings of objects. Without the uniqueness assumption on observed data elemen...
186
click to vote
ALDT
2011
Springer
14 years 6 months ago
2011
Springer
A variety of preference aggregation schemes and voting rules have been developed in social choice to support group decision making. However, the requirement that participants provi...