Sciweavers

730 search results - page 51 / 146
» Combinatorics of Monotone Computations
Sort
View
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
14 years 3 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day
LICS
2006
IEEE
14 years 2 months ago
Managing Digital Rights using Linear Logic
Digital music players protect songs by enforcing licenses that convey specific rights for individual songs or groups of songs. For licenses specified in industry, we show that d...
Adam Barth, John C. Mitchell
JANCL
2008
170views more  JANCL 2008»
13 years 8 months ago
Algorithmic correspondence and completeness in modal logic
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
Willem Conradie, Valentin Goranko
JCSS
2006
77views more  JCSS 2006»
13 years 8 months ago
Sequential predictions based on algorithmic complexity
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=-log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomonof...
Marcus Hutter
VLSID
2006
IEEE
83views VLSI» more  VLSID 2006»
14 years 9 months ago
Parasitic Aware Routing Methodology Based on Higher Order RLCK Moment Metrics
In the multi-GHz frequency domain, inductive and capacitive parasitics of interconnects can cause significant 'ringing' or overdamping, which may lead to false switching...
Amitava Bhaduri, Ranga Vemuri