Sciweavers

1169 search results - page 12 / 234
» Two Ways to Common Knowledge
Sort
View
AAAI
1998
14 years 11 months ago
Two Forms of Dependence in Propositional Logic: Controllability and Definability
We investigate two forms of dependence between variables and/or formulas within a propositional knowledge base: controllability (a set of variables X controls a formula , if there...
Jérôme Lang, Pierre Marquis
ISDA
2009
IEEE
15 years 4 months ago
Similarity Analysis of Protein Binding Sites: A Generalization of the Maximum Common Subgraph Measure Based on Quasi-Clique Dete
—Protein binding sites are often represented by means of graphs capturing their most important geometrical and physicochemical properties. Searching for structural similarities a...
Imen Boukhris, Zied Elouedi, Thomas Fober, Marco M...
GLVLSI
2005
IEEE
97views VLSI» more  GLVLSI 2005»
15 years 3 months ago
On equivalence checking and logic synthesis of circuits with a common specification
In this paper we develop a theory of equivalence checking (EC) and logic synthesis of circuits with a common specification (CS). We show that two combinational circuits N1, N2 have...
Eugene Goldberg
POPL
2004
ACM
15 years 10 months ago
Formalization of generics for the .NET common language runtime
We present a formalization of the implementation of generics in the .NET Common Language Runtime (CLR), focusing on two novel aspects of the implementation: mixed specialization a...
Dachuan Yu, Andrew Kennedy, Don Syme
UML
2005
Springer
15 years 3 months ago
Capturing Common and Variable Design Aspects for Ubiquitous Computing with MB-UID
Developing user interfaces for ubiquitous environments is a challenging task. In such an environment, users can apply different devices to accomplish the same or different tasks. ...
Alexander Boedcher, Kizito Mukasa, Detlef Zuelke