11160 search results - page 106 / 2232 » Incompleteness in a General Setting |
91
Voted
FFA
2006
15 years 19 days ago
2006
We determine information sets for the generalized Reed-Muller codes and use these to apply partial permutation decoding to codes from finite geometries over prime fields. We also ...
109
Voted
CORR
2007
Springer
15 years 18 days ago
2007
Springer
We propose a definition for the entropy of capacities defined on lattices. Classical capacities are monotone set functions and can be seen as a generalization of probability mea...
99
Voted
PADL
2004
Springer
15 years 6 months ago
2004
Springer
In this paper we show how CR-Prolog, a recent extension of A-Prolog, was used in the successor of USA-Advisor (USA-Smart) in order to improve the quality of the plans returned. The...
98
Voted
CORR
2010
Springer
15 years 22 days ago
2010
Springer
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...
113
click to vote
ACMICEC
2003
ACM
15 years 5 months ago
2003
ACM
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...