6045 search results - page 296 / 1209 » Computable Linearizations of Well-partial-orderings |
232
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
195
click to vote
AMAI
2006
Springer
15 years 7 months ago
2006
Springer
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
198
click to vote
JMM2
2007
15 years 7 months ago
2007
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
193
click to vote
LICS
1994
IEEE
15 years 11 months ago
1994
IEEE
I give a `totality space' model for linear logic [4], detaking an abstract view of computations on a datatype. The model has similarities with both the coherence space model ...
185
click to vote
EUROGP
2008
Springer
15 years 9 months ago
2008
Springer
We present N-gram GP, an estimation of distribution algorithm for the evolution of linear computer programs. The algorithm learns and samples the joint probability distribution of...