Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9718255 | Nonlinear Analysis: Theory, Methods & Applications | 2005 | 11 Pages |
Abstract
This paper addresses the problem of symbolic optimization of functions defined over finite discrete sets. In connection with the main goal of the paper, several interesting properties of Boolean functions are discovered, related to a particular function representation, over the vertices of hyper-cube {-1,1}k. The symbolic algorithm which is proposed has essentially the same computational complexity as the classical search methods, with the advantage of its possible application to parametric optimization.
Related Topics
Physical Sciences and Engineering
Engineering
Engineering (General)
Authors
Juan Cardillo, Ferenc Szigeti, Jean Claude Hennet, Jean Louis Calvet,