The problem of partner finding is to identify which entities (agents) can provide requested services from a group of entities. It can be found in open and distributed environment...
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
BDI (Belief, Desire, Intention) agent systems are very powerful, but they lack the ability to incorporate planning. There has been some previous work to incorporate planning withi...
: Users of front office applications such as call center or customer support applications make millions and millions of decisions each day without analytical support. For example, ...
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...