Sciweavers

1054 search results - page 50 / 211
» A Formalization of the Turing Test
Sort
View
SAC
2008
ACM
15 years 4 months ago
Adding background knowledge to formal concept analysis via attribute dependency formulas
We present a way to add user's background knowledge to formal concept analysis. The type of background knowledge we deal with relates to relative importance of attributes in ...
Radim Belohlávek, Vilém Vychodil
AMAI
2011
Springer
14 years 4 months ago
Similarity measures in formal concept analysis
Formal concept analysis (FCA) has been applied successively in diverse fields such as data mining, conceptual modeling, social networks, software engineering, and the semantic we...
Faris Alqadah, Raj Bhatnagar
POPL
2005
ACM
16 years 4 months ago
Formal prototyping in early stages of protocol design
Network protocol design is usually an informal process where debugging is based on successive iterations of a prototype implementation. The feedback provided by a prototype can be...
Alwyn Goodloe, Carl A. Gunter, Mark-Oliver Stehr
SIAMCOMP
2002
90views more  SIAMCOMP 2002»
15 years 4 months ago
A Virtually Synchronous Group Multicast Algorithm for WANs: Formal Approach
This paper presents a formal design for a novel group communication service targeted for WANs. The service provides Virtual Synchrony semantics. Such semantics facilitate the desi...
Idit Keidar, Roger Khazan
DAC
2009
ACM
16 years 5 months ago
Computing bounds for fault tolerance using formal techniques
Continuously shrinking feature sizes result in an increasing susceptibility of circuits to transient faults, e.g. due to environmental radiation. Approaches to implement fault tol...
André Sülflow, Görschwin Fey, Rol...