Sciweavers

4940 search results - page 576 / 988
» On the Complexity of Universal Programs
Sort
View
FPL
2007
Springer
94views Hardware» more  FPL 2007»
16 years 29 days ago
A Many-core Implementation based on the Reconfigurable Mesh Model
The reconfigurable mesh is a model for massively parallel computing for which many algorithms with very low complexity have been developed. These algorithms execute cycles of bus...
Heiner Giefers, Marco Platzner
WECWIS
2006
IEEE
103views ECommerce» more  WECWIS 2006»
16 years 24 days ago
Toward Semantic Composition of Web Services with MOVE
This paper describes a software solution for the WSChallenge 2006. We introduce the MOVE framework that has been applied to this challenge. Also, the architecture, algorithms, and...
Jürgen Dorn, Albert Rainer, Peter Hrastnik
HASE
2005
IEEE
16 years 12 days ago
Automatic Generation of Executable Assertions for Runtime Checking Temporal Requirements
Checking various temporal requirements is a key dependability concern in safety-critical systems. As modelchecking approaches do not scale well to systems of high complexity the r...
Gergely Pintér, István Majzik
ECAL
2005
Springer
16 years 9 days ago
A Developmental Model for Generative Media
Abstract. Developmental models simulate the spatio-temporal development of a complex system. The system described in this paper combines the advantages of a number of previously di...
Jon McCormack
ICALP
2005
Springer
16 years 9 days ago
Logics for Unranked Trees: An Overview
Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purpo...
Leonid Libkin