20294 search results - page 133 / 4059 » Algorithmic Information Theory |
197
click to vote
CP
2004
Springer
15 years 9 months ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
156
click to vote
IGPL
2011
14 years 11 months ago
2011
We show that the equational theory of representable lattice-ordered residuated semigroups is not finitely axiomatizable. We apply this result to the problem of completeness of su...
233
click to vote
POPL
2009
ACM
16 years 5 months ago
2009
ACM
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
143
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
The process of rank aggregation is intimately intertwined with the structure of skew-symmetric matrices. We apply recent advances in the theory and algorithms of matrix completion...
146
click to vote
PPSN
2010
Springer
15 years 2 months ago
2010
Springer
Solutions calculated by Evolutionary Algorithms have come to surpass exact methods for solving various problems. The Rubik’s Cube multiobjective optimization problem is one such ...