Sciweavers

670 search results - page 52 / 134
» Brain-Like Approximate Reasoning
Sort
View
FOIKS
2010
Springer
14 years 4 months ago
Towards a Paradoxical Description Logic for the Semantic Web
As a vision for the future of the Web, the Semantic Web is an open, constantly changing and collaborative environment. Hence it is reasonable to expect that knowledge sources in th...
Xiaowang Zhang, Zuoquan Lin, Kewen Wang
GIS
2007
ACM
14 years 11 months ago
Dynamics-aware similarity of moving objects trajectories
This work addresses the problem of obtaining the degree of similarity between trajectories of moving objects. Typically, a Moving Objects Database (MOD) contains sequences of (loc...
Goce Trajcevski, Hui Ding, Peter Scheuermann, Robe...
ICC
2007
IEEE
110views Communications» more  ICC 2007»
14 years 4 months ago
Performance of Interleave Division Multiple Access Based on Minimum Mean Square Error Detection
— Interleave division multiple access (IDMA) recently attracted many research activities because of its excellent performance despite its reasonable low complexity. The low compl...
Katsutoshi Kusume, Guido Dietl, Wolfgang Utschick,...
ATAL
2006
Springer
14 years 1 months ago
Decentralized planning under uncertainty for teams of communicating agents
Decentralized partially observable Markov decision processes (DEC-POMDPs) form a general framework for planning for groups of cooperating agents that inhabit a stochastic and part...
Matthijs T. J. Spaan, Geoffrey J. Gordon, Nikos A....
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 10 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah