Sciweavers

921 search results - page 80 / 185
» Expressing Computational Complexity in Constructive Type The...
Sort
View
IPPS
1996
IEEE
14 years 2 days ago
Commutativity Analysis: A Technique for Automatically Parallelizing Pointer-Based Computations
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
Martin C. Rinard, Pedro C. Diniz
ANSS
2007
IEEE
14 years 2 months ago
Evaluating the Design of Biological Cells Using a Computer Workbench
For embedded systems as well as for biological cell systems, design is a feature that defines their identity. The assembly of different components in designs of both systems can ...
Tessa E. Pronk, Simon Polstra, Andy D. Pimentel, T...
PPOPP
2010
ACM
14 years 5 months ago
Featherweight X10: a core calculus for async-finish parallelism
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
Jonathan K. Lee, Jens Palsberg
IJCNN
2008
IEEE
14 years 2 months ago
Dynamic logic of phenomena and cognition
—Modeling of complex phenomena such as the mind presents tremendous computational complexity challenges. The neural modeling fields theory (NMF) addresses these challenges in a n...
Boris Kovalerchuk, Leonid I. Perlovsky
COMPLEX
2009
Springer
14 years 2 months ago
Transforming Time Series into Complex Networks
We introduce transformations from time series data to the domain of complex networks which allow us to characterise the dynamics underlying the time series in terms of topological ...
Michael Small, Jie Zhang, Xiaoke Xu