Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
We consider the problem of how an agent's knowledge can be updated. We propose a formal method of knowledge update on the basis of the semantics of modal logic S5. In our met...
Over the years, many Artificial Intelligence (AI) approaches have dealt with the diagnosis problem and its application in complex environments such as medical domains. Model-Based...
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
Hanghang Tong, Yasushi Sakurai, Tina Eliassi-Rad, ...