Sciweavers

140 search results - page 22 / 28
» ipl 2008
Sort
View
IPL
2008
79views more  IPL 2008»
14 years 12 months ago
The probability of "undefined" (non-converging) output in generating the universal probability distribution
In order to generate a universal probability distribution to extrapolate a binary string x of length i, we feed random bits into a universal device, M. When we find an input strin...
Ray J. Solomonoff
IPL
2008
118views more  IPL 2008»
14 years 12 months ago
Slicing for modern program structures: a theory for eliminating irrelevant loops
Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, ...
Torben Amtoft
IPL
2008
131views more  IPL 2008»
14 years 12 months ago
Ant colony optimization with partial order reduction for discovering safety property violations in concurrent models
In this article we analyze the combination of ACOhg, a new metaheuristic algorithm, plus partial order reduction applied to the problem of finding safety property violations in co...
J. Francisco Chicano, Enrique Alba
IPL
2008
82views more  IPL 2008»
14 years 12 months ago
Confusion of memory
It is a truism that for a machine to have a useful access to memory or workspace, it must "know" where its input ends and its working memory begins. Most machine models ...
Lawrence S. Moss
IPL
2008
93views more  IPL 2008»
14 years 12 months ago
Computing Longest Previous Factor in linear time and applications
We give two optimal linear-time algorithms for computing the Longest Previous Factor (LPF) array corresponding to a string w. For any position i in w, LPF[i] gives the length of th...
Maxime Crochemore, Lucian Ilie