Sciweavers

210 search results - page 4 / 42
» A Formal Theory of Key Conjuring
Sort
View
INFORMATICALT
2000
126views more  INFORMATICALT 2000»
13 years 7 months ago
Commutation in Global Supermonoid of Free Monoids
This work is an attempt of generalization of the simple statement about the requirements of commutation of words for the case of languages. In the paper, the necessary condition fo...
Anna Brosalina, Boris Melnikov
TYPES
1993
Springer
13 years 11 months ago
Proof-Checking a Data Link Protocol
Abstract. A data link protocol developed and used by Philips Electronics is modeled and veri ed using I/O automata theory. Correctness is computer-checked with the Coq proof develo...
Leen Helmink, M. P. A. Sellink, Frits W. Vaandrage...
ATAL
2005
Springer
14 years 27 days ago
A negotiation model for autonomous agents: key features and comparison with existing models
This paper presents the key features of a new negotiation model for autonomous agents. The model is generic, handles multi-party and multi-issue negotiation, acknowledges the role...
Fernando Lopes, Augusto Q. Novais, Nuno J. Mamede,...
INTERFACES
2008
128views more  INTERFACES 2008»
13 years 7 months ago
Relevance to Practice and Auction Theory: A Memorial Essay for Michael Rothkopf
re more abstract than necessary. They depend on assumptions that are highly unlikely to occur in practical situations, which are often less formal and rigid. Nonetheless, we discus...
Ronald M. Harstad, Aleksandar Sasa Pekec
PODS
2009
ACM
130views Database» more  PODS 2009»
14 years 8 months ago
The finite model theory toolbox of a database theoretician
For many years, finite model theory was viewed as the backbone of database theory, and database theory in turn supplied finite model theory with key motivations and problems. By n...
Leonid Libkin