8196 search results - page 13 / 1640 » Computational Modeling and Complexity Science |
TCS
2011
13 years 4 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
BMCBI
2010
13 years 10 months ago
2010
Background: The omics fields promise to revolutionize our understanding of biology and biomedicine. However, their potential is compromised by the challenge to analyze the huge da...
MFCS
2005
Springer
14 years 3 months ago
2005
Springer
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
ACMDIS
1997
ACM
14 years 2 months ago
1997
ACM
Human-computer interaction is multidisciplinary, drawing paradigms and techniques from both the natural sciences and the design disciplines. HCI cannot be considered a pure natura...
FIS
2008
13 years 11 months ago
2008
Most of the efforts conducted on services nowadays are focusing on aspects related to data and control flow, often disregarding the main goal of the future Internet of services, na...