In this paper we study a subclass of pebble automata (PA) for data languages for which the emptiness problem is decidable. Namely, we show that the emptiness problem for weak 2-peb...
Abstract. The Factored Markov Decision Process (FMDP) framework is a standard representation for sequential decision problems under uncertainty where the state is represented as a ...
Olga Kozlova, Olivier Sigaud, Pierre-Henri Wuillem...
Secure set-intersection computation is one of important problems in secure multiparty computation with various applications. We propose a general construction for secure 2-party se...
This paper presents a novel computational approach to the study of creativity. In particular, it discusses a modeling framework that addresses the worth of ideas ascribed by agent...
Abstract— We study averaging algorithms, when implemented in large networks of wirelessly connected elements. We extend the notion of “Increasing Correctness” (IC) which was ...