Sciweavers

1920 search results - page 98 / 384
» The Complexity of the A B C Problem
Sort
View
160
Voted
IWPSE
2003
IEEE
15 years 11 months ago
The Chaos of Software Development
In this paper we present a new perspective on the problem of complexity in software, using sound mathematical concepts from information theory such as Shannon’s Entropy [31]. We...
Ahmed E. Hassan, Richard C. Holt
FPGA
2004
ACM
137views FPGA» more  FPGA 2004»
15 years 11 months ago
Making visible the thermal behaviour of embedded microprocessors on FPGAs: a progress report
This paper shows a method to verifying the thermal status of complex FPGA-based circuits like microprocessors. Thus, the designer can evaluate if a particular block is working bey...
Sergio López-Buedo, Eduardo I. Boemo
APAL
2010
85views more  APAL 2010»
15 years 6 months ago
Elementary differences between the degrees of unsolvability and degrees of compressibility
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
George Barmpalias
WWW
2002
ACM
16 years 6 months ago
Clarifying the fundamentals of HTTP
The simplicity of HTTP was a major factor in the success of the Web. However, as both the protocol and its uses have evolved, HTTP has grown complex. This complexity results in nu...
Jeffrey C. Mogul
ICFEM
2009
Springer
15 years 4 months ago
A Time-Optimal On-the-Fly Parallel Algorithm for Model Checking of Weak LTL Properties
One of the most important open problems of parallel LTL model-checking is to design an on-the-fly scalable parallel algorithm with linear time complexity. Such an algorithm would g...
Jiri Barnat, Lubos Brim, Petr Rockai