356 search results - page 26 / 72 » Approximation schemes for the Min-Max Starting Time Problem |
PEPM
1991
ACM
13 years 11 months ago
1991
ACM
This is a follow-on to my 1988PLDIpaper, “Control-Flow Analysis e”[9]. Iusethe methodofabstractsemanticinterpretations to explicate the control-flow analysis technique presen...
CPM
1999
Springer
13 years 12 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
Publication
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
The Range Minimum Query (RMQ) Problem is to preprocess an array A of length n in O(n) time such that subsequent on-line queries asking for the position of a minimal element between...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...