Sciweavers

4940 search results - page 548 / 988
» On the Complexity of Universal Programs
Sort
View
DATE
2005
IEEE
125views Hardware» more  DATE 2005»
16 years 13 days ago
Lightweight Multitasking Support for Embedded Systems using the Phantom Serializing Compiler
Embedded software continues to play an ever increasing role in the design of complex embedded applications. In part, the elevel of abstraction provided by a high-level programming...
André C. Nácul, Tony Givargis
GECCO
2005
Springer
16 years 10 days ago
A new approach to evaluate GP schema in context
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...
Hammad Majeed
ICCS
2005
Springer
16 years 10 days ago
Automated Operation Minimization of Tensor Contraction Expressions in Electronic Structure Calculations
Abstract. Complex tensor contraction expressions arise in accurate electronic structure models in quantum chemistry, such as the Coupled Cluster method. Transformations using algeb...
Albert Hartono, Alexander Sibiryakov, Marcel Nooij...
SAC
2004
ACM
16 years 7 days ago
Frequent free tree discovery in graph data
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
Ulrich Rückert, Stefan Kramer
ISCIS
2004
Springer
16 years 5 days ago
Modelling Role-Playing Games Using PEPA Nets
Abstract. We present a performance modelling case study of a distributed multi-player game expressed in the PEPA nets modelling language. The case study provides a modern complex d...
Stephen Gilmore, Leïla Kloul, Davide Piazza