Computer based community support systems can provide powerful support in direct exchange of information and in finding people for information exchange Such applications usually mak...
We present a major improvement to the incremental pruning algorithm for solving partially observable Markov decision processes. Our technique targets the cross-sum step of the dyn...
The problem of counting the number of solutions to a constraint satisfaction problem (CSP) is rephrased in terms of probability updating in Bayes networks. Approximating the proba...
Amnon Meisels, Solomon Eyal Shimony, Gadi Solotore...
: In this paper we present an idea of trusted communication platform for Multi-Agent Systems (MAS) called TrustMAS. Based on analysis of routing protocols suitable for MAS we have ...
Krzysztof Szczypiorski, Igor Margasinski, Wojciech...
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...