1695 search results - page 15 / 339 » Linear, Polynomial or Exponential |
CPM
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
128
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
136
Voted
AIPS
2006
15 years 2 months ago
2006
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
97
Voted
CC
2007
Springer
15 years 20 days ago
2007
Springer
Mergers are procedures that, with the aid of a short random string, transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one ...
95
Voted
ICAI
2007
15 years 2 months ago
2007
Abstract— The paper proposes a dynamic programming algorithm for training of functional networks. The algorithm considers each node as a state. The problem is formulated as find...