Sciweavers

16666 search results - page 411 / 3334
» Descriptive and Computational Complexity
Sort
View
ENTCS
2011
106views more  ENTCS 2011»
15 years 1 months ago
A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi
SUBSEXPL is a system originally developed to visualise reductions, simplifications and normalisations in three important calculi of explicit substitutions and has been applied to...
F. L. C. de Moura, A. V. Barbosa, Mauricio Ayala-R...
ICFCA
2007
Springer
16 years 1 months ago
Computing Intensions of Digital Library Collections
We model a Digital Library as a formal context in which objects are documents and attributes are terms describing documents contents. A formal concept is very close to the notion o...
Carlo Meghini, Nicolas Spyratos
DSS
2007
75views more  DSS 2007»
15 years 6 months ago
Short Term and Total Life Impact analysis of email worms in computer systems
This paper develops a methodology for analyzing and predicting the impact category of malicious code, particularly email worms. The current paper develops two frameworks to classi...
Insu Park, Raj Sharman, H. Raghav Rao, Shambhu J. ...
ISORC
2006
IEEE
16 years 26 days ago
Complexity Management for Composable Real-Time Systems
Embedded real-time systems are becoming increasingly complex due to ever increasing size and functionality so that complexity management is of growing importance, especially in de...
Bernhard Rumpler
LICS
2008
IEEE
16 years 1 months ago
The Ordinal Recursive Complexity of Lossy Channel Systems
We show that reachability and termination for lossy channel systems is exactly at level Fωω in the Fast-Growing Hierarchy of recursive functions, the first level that dominates...
Pierre Chambart, Ph. Schnoebelen