Sciweavers

384 search results - page 28 / 77
» Equivalence Relations on Classes of Computable Structures
Sort
View
POPL
2008
ACM
14 years 8 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
ECOOPW
1998
Springer
13 years 12 months ago
Development and Utilization of Parallel Generic Algorithms for Scientific Computations
We develop generic parallel algorithms as extensible modules that encapsulate related classes and parallel methods. Extensible modules define common parallel structures, such as m...
Atanas Radenski, A. Vann, Boyana Norris
CORR
1999
Springer
95views Education» more  CORR 1999»
13 years 7 months ago
Fixed-parameter tractability, definability, and model checking
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
Jörg Flum, Martin Grohe
ISMB
2000
13 years 9 months ago
Search for a New Description of Protein Topology and Local Structure
A novel description of protein structure in terms of the generalized secondary structure elements (GSSE) is proposed. GSSE's are defined as fragments of the protein structure...
Lukasz Jaroszewski, Adam Godzik
FCT
1999
Springer
13 years 12 months ago
Tile Transition Systems as Structured Coalgebras
The aim of this paper is to investigate the relation between two models of concurrent systems: tile rewrite systems and coalgebras. Tiles are rewrite rules with side e ects which a...
Andrea Corradini, Reiko Heckel, Ugo Montanari