Sciweavers

4355 search results - page 227 / 871
» Increasing Kolmogorov Complexity
Sort
View
219
Voted
ITSSA
2006
89views more  ITSSA 2006»
15 years 6 months ago
A Methodology for Classifying Self-Organizing Software Systems
: The software industry is faced with the fast growing complexity of IT infrastructures. This makes manual administration increasingly difficult and appears to be the limiting fact...
Klaus Herrmann, Matthias Werner, Gero Mühl
IANDC
2007
66views more  IANDC 2007»
15 years 6 months ago
Quantitative temporal logics over the reals: PSpace and below
In many cases, the addition of metric operators to qualitative temporal logics (TLs) increases the complexity of satisfiability by at least one exponential: while common qualitat...
Carsten Lutz, Dirk Walther, Frank Wolter
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
15 years 6 months ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl
IS
2007
15 years 6 months ago
Matching large schemas: Approaches and evaluation
Current schema matching approaches still have to improve for large and complex Schemas. The large search space increases the likelihood for false matches as well as execution time...
Hong Hai Do, Erhard Rahm
TOG
2008
102views more  TOG 2008»
15 years 6 months ago
A meshless hierarchical representation for light transport
We introduce a meshless hierarchical representation for solving light transport problems. Precomputed radiance transfer (PRT) and finite elements require a discrete representation...
Jaakko Lehtinen, Matthias Zwicker, Emmanuel Turqui...