Sciweavers

509 search results - page 91 / 102
» On the completeness of compositional reasoning methods
Sort
View
CASES
2011
ACM
12 years 7 months ago
Enabling parametric feasibility analysis in real-time calculus driven performance evaluation
This paper advocates a rigorously formal and compositional style for obtaining key performance and/or interface metrics of systems with real-time constraints. We propose a hierarc...
Alena Simalatsar, Yusi Ramadian, Kai Lampka, Simon...
KDD
2004
ACM
143views Data Mining» more  KDD 2004»
14 years 8 months ago
Incremental maintenance of quotient cube for median
Data cube pre-computation is an important concept for supporting OLAP(Online Analytical Processing) and has been studied extensively. It is often not feasible to compute a complet...
Cuiping Li, Gao Cong, Anthony K. H. Tung, Shan Wan...
CORR
2002
Springer
125views Education» more  CORR 2002»
13 years 7 months ago
Complexity of Manipulating Elections with Few Candidates
In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Voting is a general method for preference aggregation, but seminal r...
Vincent Conitzer, Tuomas Sandholm
SCP
2010
155views more  SCP 2010»
13 years 6 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
WABI
2009
Springer
142views Bioinformatics» more  WABI 2009»
14 years 2 months ago
Back-Translation for Discovering Distant Protein Homologies
Background: Frameshift mutations in protein-coding DNA sequences produce a drastic change in the resulting protein sequence, which prevents classic protein alignment methods from ...
Marta Gîrdea, Laurent Noé, Gregory Ku...