文件名称:dossier
介绍说明－－下载内容均来自于网络，请自行研究使用
For the incomplete methods, we kept the representation of the queens by a table and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems than the representation by a matrix.
heuristics: descent.
Tests: 100 queens in less than 1 second and 67 iterations. 500 queens in 1 second and 257 iterations. 1000 queens in 11 seconds and 492 iterations.
heuristics: Simulated annealing.
Tests: 100 queens in less than 1 second and 47 iterations. 500 queens in 5 seconds and 243 iterations. 1000 queens in 13 seconds and 497 iterations.
heuristics: based on Simulated Annealing.
Tests: 100 queens in less than 1 second and 60 iterations. 500 queens in 1 second and 224 iterations. 1000 queens in 5 seconds and 459 iterations. 10 000 queens in 20 minutes 30 seconds and 4885 iterations.
-For the incomplete methods, we kept the representation of the queens by a tab le and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems th an the representation by a matrix. heuristics : descent. Tests : 100 queens in less than a second and 67 iteration s. 500 queens in a second and 257 iterations. 100 queens 0 in 11 seconds and 492 iterations. heuri stics : Simulated annealing. Tests : 100 queens in less than a second and 47 iteration s. 500 queens in 5 seconds and 243 iterations. 10 00 queens in 13 seconds and 497 iterations. heur istics : based on Simulated Annealing. Tests : 100 queens in less than a second and 60 iteration s. 500 queens in a second and 224 iterations. 100 0 queens in 5 seconds and 459 iterations. q 1
heuristics: descent.
Tests: 100 queens in less than 1 second and 67 iterations. 500 queens in 1 second and 257 iterations. 1000 queens in 11 seconds and 492 iterations.
heuristics: Simulated annealing.
Tests: 100 queens in less than 1 second and 47 iterations. 500 queens in 5 seconds and 243 iterations. 1000 queens in 13 seconds and 497 iterations.
heuristics: based on Simulated Annealing.
Tests: 100 queens in less than 1 second and 60 iterations. 500 queens in 1 second and 224 iterations. 1000 queens in 5 seconds and 459 iterations. 10 000 queens in 20 minutes 30 seconds and 4885 iterations.
-For the incomplete methods, we kept the representation of the queens by a tab le and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems th an the representation by a matrix. heuristics : descent. Tests : 100 queens in less than a second and 67 iteration s. 500 queens in a second and 257 iterations. 100 queens 0 in 11 seconds and 492 iterations. heuri stics : Simulated annealing. Tests : 100 queens in less than a second and 47 iteration s. 500 queens in 5 seconds and 243 iterations. 10 00 queens in 13 seconds and 497 iterations. heur istics : based on Simulated Annealing. Tests : 100 queens in less than a second and 60 iteration s. 500 queens in a second and 224 iterations. 100 0 queens in 5 seconds and 459 iterations. q 1
(系统自动生成,下载前可以参看下载内容)
下载文件列表
压缩包 : 9927404dossier.rar 列表 Nouveau dossier\RSv2\reines.c Nouveau dossier\RSv2\WS_FTP.LOG Nouveau dossier\RSv2\result Nouveau dossier\RSv2 Nouveau dossier\backDecal\reines.c Nouveau dossier\backDecal\WS_FTP.LOG Nouveau dossier\backDecal\result Nouveau dossier\backDecal Nouveau dossier\backMinPlace\reines.c Nouveau dossier\backMinPlace\WS_FTP.LOG Nouveau dossier\backMinPlace\result Nouveau dossier\backMinPlace Nouveau dossier\backRecursif\placement.txt Nouveau dossier\backRecursif\WS_FTP.LOG Nouveau dossier\backRecursif\reines.c Nouveau dossier\backRecursif\result Nouveau dossier\backRecursif Nouveau dossier\descente\reines.c Nouveau dossier\descente\WS_FTP.LOG Nouveau dossier\descente\result Nouveau dossier\descente Nouveau dossier\RS\reines.c Nouveau dossier\RS\WS_FTP.LOG Nouveau dossier\RS\result Nouveau dossier\RS Nouveau dossier\Nouveau Document Microsoft Word.doc Nouveau dossier