11 search results - page 1 / 3 » Reducing Epistasis in Combinatorial Problems by Expansive Co... |
ICGA
1993
13 years 6 months ago
1993
TIT
2008
13 years 4 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
ICPP
2002
IEEE
13 years 9 months ago
2002
IEEE
Code size expansion of software-pipelined loops is a critical problem for DSP systems with strict code size constraint. Some ad-hoc code size reduction techniques were used to try...
CP
2004
Springer
13 years 10 months ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
ICIP
2000
IEEE
14 years 6 months ago
2000
IEEE
Optimal fractal coding consists of finding in a finite set of contractive affine mappings one whose unique fixed point is closest to the original image. Optimal fractal coding is ...