Results 11  20
of
254,623
Binary vs. nonbinary constraints ✩ www.elsevier.com/locate/artint
, 2001
"... There are two well known transformations from nonbinary constraints to binary constraints applicable to constraint satisfaction problems (CSPs) with finite domains: the dual transformation and the hidden (variable) transformation. We perform a detailed formal comparison of these two transformations ..."
Abstract
 Add to MetaCart
There are two well known transformations from nonbinary constraints to binary constraints applicable to constraint satisfaction problems (CSPs) with finite domains: the dual transformation and the hidden (variable) transformation. We perform a detailed formal comparison of these two
MAS: An Online Nonbinary CSP Solver
"... Nowadays, many dynamic problems can be efficiently modelled as Constraint Satisfaction Problems (CSPs). These constraints may be online nonbinary constraints that traditional CSP solver can not manage directly. It is well known that any nonbinary CSP can be transformed into an equivalent bina ..."
Abstract
 Add to MetaCart
Nowadays, many dynamic problems can be efficiently modelled as Constraint Satisfaction Problems (CSPs). These constraints may be online nonbinary constraints that traditional CSP solver can not manage directly. It is well known that any nonbinary CSP can be transformed into an equivalent
Encodings of NonBinary Constraint Satisfaction Problems
"... We perform a detailed theoretical and empirical comparison of the dual and hidden variable encodings of nonbinary constraint satisfaction problems. We identify a simple relationship between the two encodings by showing how we can translate between the two by composing or decomposing relations. This ..."
Abstract
 Add to MetaCart
We perform a detailed theoretical and empirical comparison of the dual and hidden variable encodings of nonbinary constraint satisfaction problems. We identify a simple relationship between the two encodings by showing how we can translate between the two by composing or decomposing relations
An Incremental and Nonbinary CSP Solver: The Hyperpolyhedron Search Algorithm
 in Proceedings of Seventh International Conference on Principles and Practice of Constraint Programming
, 2001
"... Constraint programming is gaining a great deal of attention because many combinatorial problems especially in areas of planning and scheduling can be expressed in a natural way as a Constraint Satisfaction Problem (CSP). It is well known that a nonbinary CSP can be transformed into an equivalent bi ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
Constraint programming is gaining a great deal of attention because many combinatorial problems especially in areas of planning and scheduling can be expressed in a natural way as a Constraint Satisfaction Problem (CSP). It is well known that a nonbinary CSP can be transformed into an equivalent
Short LowRate NonBinary Turbo Codes
"... Abstract—A serial concatenation of an outer nonbinary turbo code with different inner binary codes is introduced and analyzed. The turbo code is based on memory1 timevariant recursive convolutional codes over high order fields. The resulting codes possess low rates and capacityapproaching perfo ..."
Abstract
 Add to MetaCart
Abstract—A serial concatenation of an outer nonbinary turbo code with different inner binary codes is introduced and analyzed. The turbo code is based on memory1 timevariant recursive convolutional codes over high order fields. The resulting codes possess low rates and capacity
POLYSA: A Polynomial Algorithm for Nonbinary Constraint Satisfaction Problems
 In Proceeding of EPIA workshop on Constraint Satisfaction and Operational Research Techniques for Problem Solving (CSOR01) (2001
, 2001
"... Nowadays, many real problems can be naturally modelled as Constraint Satisfaction Problems (CSPs). It is well known that any nonbinary CSP can be transformed into an equivalent binary one, using some of the current techniques. However, this transformation may not be practical in problems with c ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Nowadays, many real problems can be naturally modelled as Constraint Satisfaction Problems (CSPs). It is well known that any nonbinary CSP can be transformed into an equivalent binary one, using some of the current techniques. However, this transformation may not be practical in problems
ITERATIVE EQUALISER AND LDPC ALGORITHMS USING SPACE TIME BLOCK CODED OVER NONBINARY FIELDS APPLIED TO WIRELESS CHANNEL
"... Abstract The aim of this paper is to propose a new combination of turbo equalisation with Low Density Parity Check (LDPC) both over nonbinary fields, concatenated with space time block coded over a wireless channel with QPSK modulation. A detail comparison with other communication methods such as ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract The aim of this paper is to propose a new combination of turbo equalisation with Low Density Parity Check (LDPC) both over nonbinary fields, concatenated with space time block coded over a wireless channel with QPSK modulation. A detail comparison with other communication methods
Phase Transition Behaviour in
, 1997
"... Many problems in artificial intelligence and computer science can be formulated as constraint satisfaction problems (CSPs). A CSP consists of a set of variables among which a set of constraints are imposed, with a solution corresponding to an assignment for every variable such that no constraints ar ..."
Abstract
 Add to MetaCart
Many problems in artificial intelligence and computer science can be formulated as constraint satisfaction problems (CSPs). A CSP consists of a set of variables among which a set of constraints are imposed, with a solution corresponding to an assignment for every variable such that no constraints are violated. Most forms of CSP are NPcomplete.
1Simple LowRate NonBinary LDPC Coding for Relay Channels
"... Abstract—Binary LDPC coded relay systems have been well studied previously with the assumption of infinite codeword length. In this paper, we deal with nonbinary LDPC codes which can outperform their binary counterpart especially for practical codeword length. We utilize nonbinary LDPC codes and r ..."
Abstract
 Add to MetaCart
and recently invented nonbinary coding techniques known as multiplicative repetition to design the lowrate coding strategy for the decodeandforward halfduplex relay channel. We claim that the proposed strategy is simple since the destination and the relay can decode with almost the same computational
Results 11  20
of
254,623