1948 search results - page 207 / 390 » Formalizing Mirror Theory |
202
click to vote
IDTRUST
2009
ACM
16 years 1 months ago
2009
ACM
We introduce a formal semantics based calculus of trust that explicitly represents trust and quantifies the risk associated with trust in public key infrastructure (PKI) and iden...
158
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
166
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
We consider a restricted variant of the hairpin completion called bounded hairpin completion. The hairpin completion is a formal operation inspired from biochemistry. Applied to a ...
180
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
In hedonic games, players have the opportunity to form coalitions, and have preferences over the coalitions they might join. Such games can be used to model a variety of settings ...
146
click to vote
COSIT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Ontologies are a common approach to improve semantic interoperability by explicitly specifying the vocabulary used by a particular information community. Complex expressi...