Sciweavers

4218 search results - page 158 / 844
» Complete sets of cooperations
Sort
View
HICSS
2002
IEEE
130views Biometrics» more  HICSS 2002»
14 years 3 months ago
A Set Theory Based Approach on Applying Domain Semantics to XML Structures
As XML is gathering more and more importance in the field of data interchange in distributed business to business (B2B) applications, it is increasingly important to provide a for...
Wolfgang Schuetzelhofer, Karl M. Göschka
KAIS
2011
79views more  KAIS 2011»
13 years 5 months ago
A general framework for measuring inconsistency through minimal inconsistent sets
Abstract. Hunter and Konieczny explored the relationships between measures of inconsistency for a belief base and the minimal inconsistent subsets of that belief base in several of...
Kedian Mu, Weiru Liu, Zhi Jin
AAAI
2010
13 years 11 months ago
Ad Hoc Autonomous Agent Teams: Collaboration without Pre-Coordination
As autonomous agents proliferate in the real world, both in software and robotic settings, they will increasingly need to band together for cooperative activities with previously ...
Peter Stone, Gal A. Kaminka, Sarit Kraus, Jeffrey ...
ARSCOM
2007
191views more  ARSCOM 2007»
13 years 10 months ago
Binomial Identities Generated by Counting Spanning Trees
We partition the set of spanning trees contained in the complete graph Kn into spanning trees contained in the complete bipartite graph Ks,t. This relation will show that any prop...
Thomas Dale Porter
CORR
2010
Springer
158views Education» more  CORR 2010»
13 years 10 months ago
A Minimal Propositional Type Theory
Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show ...
Mark Kaminski, Gert Smolka