10493 search results - page 9 / 2099 » Dynamic Word Problems |
125
Voted
SIAMCO
2011
14 years 5 months ago
2011
Abstract. We prove a weak version of the dynamic programming principle for standard stochastic control problems and mixed control-stopping problems, which avoids the technical diļ¬...
115
click to vote
NA
2010
15 years 18 days ago
2010
In the past decade or so, semi-deļ¬nite programming (SDP) has emerged as a powerful tool capable of handling a remarkably wide range of problems. This article describes an innovat...
130
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
127
click to vote
ICVS
2009
Springer
14 years 12 months ago
2009
Springer
This paper introduces a system that automatically classifies registration problems based on the type of registration required. Rather than rely on a single "best" algorit...
113
Voted
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
Abstract The 2-Interval Pattern problem is to ļ¬nd the largest constrained pattern in a set of 2-intervals. The constrained pattern is a subset of the given 2-intervals such that ...