1220 search results - page 46 / 244 » Restricting grammatical complexity |
123
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
216
Voted
CP
2009
Springer
16 years 3 months ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
MFCS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
128
click to vote
STACS
2007
Springer
15 years 8 months ago
2007
Springer
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...
147
Voted
IEEEARES
2006
IEEE
15 years 8 months ago
2006
IEEE
Failure diagnosis in large and complex systems is a critical task. A discrete event system (DES) approach to the problem of failure diagnosis is presented in this paper. A classic...