Sciweavers

2563 search results - page 301 / 513
» Phenomenology, Representations and Complexity
Sort
View
KI
2006
Springer
15 years 7 months ago
A New n-ary Existential Quantifier in Description Logics
Motivated by a chemical process engineering application, we introduce a new concept constructor in Description Logics (DLs), an n-ary variant of the existential restriction constr...
PPL
2008
99views more  PPL 2008»
15 years 7 months ago
A Modular Implementation of Data Structures in Bulk-Synchronous Parallel ML
A functional data-parallel language called BSML has been designed for programming Bulk-Synchronous Parallel algorithms. Many sequential algorithms do not have parallel counterpart...
Frédéric Gava
NJC
2006
102views more  NJC 2006»
15 years 7 months ago
Online Evaluation of Regular Tree Queries
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
Alexandru Berlea
IJNSEC
2007
128views more  IJNSEC 2007»
15 years 7 months ago
LFSR-based Signatures with Message Recovery
In order to reduce key sizes and bandwidth, several LFSRbased (linear feedback shift register) public key cryptosystems and signature schemes have been proposed. Digital signature...
Xiangxue Li, Dong Zheng, Kefei Chen
SYNTHESE
2008
114views more  SYNTHESE 2008»
15 years 7 months ago
Quantified coalition logic
We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs o...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...