Sciweavers

1017 search results - page 169 / 204
» Some existence and construction results of polygonal designs
Sort
View
CORR
2010
Springer
180views Education» more  CORR 2010»
15 years 6 months ago
Dependability in Aggregation by Averaging
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
CIARP
2009
Springer
16 years 21 days ago
Analysis of the GRNs Inference by Using Tsallis Entropy and a Feature Selection Approach
Abstract. An important problem in the bioinformatics field is to understand how genes are regulated and interact through gene networks. This knowledge can be helpful for many appl...
Fabrício Martins Lopes, Evaldo A. de Olivei...
PLDI
1994
ACM
15 years 10 months ago
Memory Access Coalescing: A technique for Eliminating Redundant memory Accesses
As microprocessor speeds increase, memory bandwidth is increasing y the performance bottleneck for microprocessors. This has occurred because innovation and technological improvem...
Jack W. Davidson, Sanjay Jinturkar
ICFEM
2009
Springer
15 years 3 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...
TSE
2011
114views more  TSE 2011»
15 years 1 months ago
Loupe: Verifying Publish-Subscribe Architectures with a Magnifying Lens
Abstract— The Publish-Subscribe (P/S) communication paradigm fosters high decoupling among distributed components. This facilitates the design of dynamic applications, but also i...
Luciano Baresi, Carlo Ghezzi, Luca Mottola