DocumentCode :
2844435
Title :
An image-guided heuristic for planning an exhaustive enumeration
Author :
Chua, Joselíto J. ; Rao, Asha
Author_Institution :
Sch. of Comput. Sci. & Software Eng., Monash Univ., Clayton, Vic., Australia
fYear :
2004
fDate :
5-8 Dec. 2004
Firstpage :
136
Lastpage :
141
Abstract :
This paper proposes a heuristic for planning a distributed search that yields an exhaustive enumeration. The paper is motivated by the need to search for binary extremal self-dual codes. The proposed technique represents the search space as an image. A partial image is obtained by a preliminary sampling of the search space. We propose an image restoration algorithm which can be applied on the partial image in order to identify regions of interest, and prioritize the search accordingly. Experimental results show that the technique can guide the search effectively.
Keywords :
Hadamard matrices; dual codes; image restoration; planning (artificial intelligence); search problems; binary extremal self-dual codes; distributed search; exhaustive enumeration; image restoration algorithm; image-guided heuristic; search space; Computational efficiency; Computer science; Error correction; Error correction codes; Image restoration; Image sampling; Mathematics; Robustness; Software; Statistical distributions;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Hybrid Intelligent Systems, 2004. HIS '04. Fourth International Conference on
Print_ISBN :
0-7695-2291-2
Type :
conf
DOI :
10.1109/ICHIS.2004.23
Filename :
1409994
Link To Document :
بازگشت