Sciweavers

1302 search results - page 41 / 261
» Fair Equivalence Relations
Sort
View
ADC
2006
Springer
128views Database» more  ADC 2006»
14 years 3 months ago
Horn clauses and functional dependencies in complex-value databases
We extend Fagin’s result on the equivalence between functional dependencies in relational databases and propositional Horn clauses. It is shown that this equivalence still holds...
Sven Hartmann, Sebastian Link
IEEEICCI
2005
IEEE
14 years 2 months ago
Formal concept analysis based on hierarchical class analysis
The study of concept formation and learning is a central topic in cognitive informatics. Formal concept analysis can be viewed as an approach on this topic based on a formal conte...
Yaohua Chen, Yiyu Yao
TVLSI
2008
151views more  TVLSI 2008»
13 years 8 months ago
Guest Editorial Special Section on Design Verification and Validation
ion levels. The framework also supports the generation of test constraints, which can be satisfied using a constraint solver to generate tests. A compositional verification approac...
I. Harris, D. Pradhan
INFOCOM
2006
IEEE
14 years 3 months ago
TCP as an Implementation of Age-Based Scheduling: Fairness and Performance
— We show that different flavors of TCP may be viewed as implementations of age-based scheduling disciplines. By parameterizing the scheduling disciplines of interest we are abl...
Arzad Alam Kherani, Rudesindo Núñez-...
SPAA
2003
ACM
14 years 2 months ago
A proportionate fair scheduling rule with good worst-case performance
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
Micah Adler, Petra Berenbrink, Tom Friedetzky, Les...