Sciweavers

279 search results - page 8 / 56
» A Name Abstraction Functor for Named Sets
Sort
View
FUIN
2007
116views more  FUIN 2007»
13 years 8 months ago
Path Compression in Timed Automata
The paper presents a method of abstraction for timed systems. To extract an abstract model of a timed system we propose to use static analysis, namely a technique called path compr...
Agata Janowska, Wojciech Penczek
IJFCS
2007
98views more  IJFCS 2007»
13 years 8 months ago
Modular Ranking Abstraction
Ranking Abstraction Ittai Balaban Computer Science Department, New York University, 251 Mercer St., New York, New York 10012, United States and Amir Pnueli Computer Science Departm...
Ittai Balaban, Amir Pnueli, Lenore D. Zuck
STACS
2009
Springer
14 years 3 months ago
Undecidable Properties of Limit Set Dynamics of Cellular Automata
Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A w...
Pietro di Lena, Luciano Margara
WOB
2007
13 years 9 months ago
Gene Set Enrichment Analysis Using Non-parametric Scores
Abstract. Gene Set Enrichment Analysis (GSEA) is a well-known technique used for studying groups of functionally related genes and their correlation with phenotype. This method cre...
Ariel E. Bayá, Mónica G. Larese, Pab...
HIPEAC
2007
Springer
14 years 2 months ago
Applying Decay to Reduce Dynamic Power in Set-Associative Caches
Abstract. In this paper, we propose a novel approach to reduce dynamic power in set-associative caches that leverages on a leakage-saving proposal, namely Cache Decay. We thus open...
Georgios Keramidas, Polychronis Xekalakis, Stefano...