loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06)
Genetic Algorithms for Hunting Snakes in Hypercubes: Fitness Function Analysis and Open Questions
Las Vegas, Nevada
June 19-June 20
ISBN: 0-7695-2611-X
ASCII Text
x 
 
Pedro A. Diaz-Gomez, Dean F. Hougen, "Genetic Algorithms for Hunting Snakes in Hypercubes: Fitness Function Analysis and Open Questions," Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, International Conference on & Self-Assembling Wireless Networks, International Workshop on, pp. 389-394, Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/SNPD-SAWN.2006.41,
author = {Pedro A. Diaz-Gomez and Dean F. Hougen},
title = {Genetic Algorithms for Hunting Snakes in Hypercubes: Fitness Function Analysis and Open Questions},
journal ={Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, International Conference on & Self-Assembling Wireless Networks, International Workshop on},
volume = {0},
year = {2006},
isbn = {0-7695-2611-X},
pages = {389-394},
doi = {http://doi.ieeecomputersociety.org/10.1109/SNPD-SAWN.2006.41},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, International Conference on & Self-Assembling Wireless Networks, International Workshop on
TI - Genetic Algorithms for Hunting Snakes in Hypercubes: Fitness Function Analysis and Open Questions
SN - 0-7695-2611-X
SP389
EP394
A1 - Pedro A. Diaz-Gomez,
A1 - Dean F. Hougen,
PY - 2006
KW - null
VL - 0
JA - Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, International Conference on & Self-Assembling Wireless Networks, International Workshop on
ER -
 
Pedro A. Diaz-Gomez, University of Oklahoma, OK, USA
Dean F. Hougen, University of Oklahoma, OK, USA
Hunting for snakes of maximum length in hypercubes has been addressed with non-heuristic methods for hypercubes of dimension less than eight. Above that dimension the problem is intractable because the search grows exponentially with the dimension, which make it an NP-hard problem. Heuristic methods, like genetic algorithms, have been used to solve this kind of problem. We propose different fitness functions to find snakes in hypercubes of dimension greater than three and pose some open questions regarding the number of maximum length snakes in a hypercube of dimension d.
Citation:
Pedro A. Diaz-Gomez, Dean F. Hougen, "Genetic Algorithms for Hunting Snakes in Hypercubes: Fitness Function Analysis and Open Questions," snpd-sawn, pp.389-394, Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.