Sciweavers

784 search results - page 131 / 157
» Relaxing the Value Restriction
Sort
View
ECCC
2010
73views more  ECCC 2010»
13 years 9 months ago
Matching Vector Codes
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 ...
Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin
FIRSTMONDAY
2008
121views more  FIRSTMONDAY 2008»
13 years 9 months ago
Free and Open Source Licenses in Community Life: Two Empirical Cases
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
CORR
2006
Springer
150views Education» more  CORR 2006»
13 years 9 months ago
The approximability of MAX CSP with fixed-value constraints
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...
FUIN
2006
85views more  FUIN 2006»
13 years 9 months ago
Towards Integrated Verification of Timed Transition Models
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...
Mark Lawford, Vera Pantelic, Hong Zhang
HEURISTICS
2006
102views more  HEURISTICS 2006»
13 years 9 months ago
A logic of soft constraints based on partially ordered preferences
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...
Nic Wilson