An (r, , )-locally decodable code encodes a k-bit message x to an N-bit codeword C(x), such that for every i [k], the i-th message bit can be recovered with probability 1 - , by ...
How do licenses participate in Free and Open Source Software (FLOSS) community life? This paper aims at answering this question. Despite the dynamic character of FLOSS development...
Stefano De Paoli, Maurizio Teli, Vincenzo D'Andrea
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
Vladimir G. Deineko, Peter Jonsson, Mikael Klasson...
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...