¡@

½Òµ{ºõ­n         ­×²ßºtºâªkªº²z¥Ñ
²ßÃD ±Ð¬ì®Ñ¥Xª©°Ó¸ê°T
term project¹ê¬I­nÂI

Instructor: ·¨©÷³C

Office:  ¸ê°T¤uµ{¨tF5020«Ç
Tel: 07-5252000 Âà 4333 
E-mail: cbyang@cse.nsysu.edu.tw

§U±Ð¸s¡G

¶À°êâ¡Ghuangks@cse.nsysu.edu.tw

´¿°ê´L¡Gtsengkt@cse.nsysu.edu.tw

´^¥Ã¿³¡Gpengyh@par.cse.nsysu.edu.tw

¬ã¨s«Ç¡G ¸ê°T¤uµ{¾Ç¨t F5013«Ç
¹q¸Ü
(¤½)¡G07-5252000 Âà 4345


½Òµ{Á¿¸q¡]¥H¤UÁ¿¸q¬°PowerpointÀɮסA­Y»Ý¦L¥X®É¡A³Ì¦n§Q¥Î¦Lªí¾÷¡]©Îfine printer³nÅé¡^±N¤G­¶¡]©Î¥|­¶¡^¦X¨Ö¤@­¶¦C¦L¡C½Ð¤£­n¨Ï¥ÎPowerpoint©Ò´£¨Ñªº¤G­¶¡]©Î¥|­¶¡^¡A¦]¬°®ÄªG¤£¦n¡^¡G

µù1¡G¦¹Àɮ׬°Powerpoint 2000©Ò»s§@¡A­Y¥Î¨ä¥Lª©¥»ªºPowerpoint¥´¶}¡A¦³¨Ç¯S®í²Å¸¹¥i¯àÅܧΡC

µù2¡G­Y¦³¦Ñ®v»Ý­n§Q¥Î¦¹Á¿¸q±Ð¾Ç¡AÅwªï¤U¸ü¨Ï¥Î¡A¦ý½Ð¨Æ¥ýe-mail§iª¾¡C

µù3¡G­×¥»½Òµ{¦P¾Ç¡A½Ð©ó¤W½Ò«e¡A¦Û¦æ¦L¥XÁ¿¸q

Chap1. Introduction
Chap2. The Complexity of Algorithms and the Lower Bounds of Problems 
Chap3.The Theory of NP-Completeness 
Chap4. The Greedy Method 
Chap5. The Divide-and-Conquer Strategy 
Chap6. The Searching Strategy
Chap7. Prune-and-Search 
Chap8. Dynamic Programming 
Chap9. Approximation Algorithms 
Chap10. Amortized Analysis 
Chap11. Randomized Algorithms 


¬ÛÃö³sµ²
A compendium of NP optimization problems (¦¬¶°¤F³\¦hNP-complete °ÝÃD¡A¨ä¥i¯àªºapproximation ¸Ñªk¡A¥H¤Î¬ÛÃö½×¤å¦Cªí)
Exact String Matching Algorithms (¦¬¶°¼Æ¤QºØ¦r¦ê¤ñ¹ï¤èªk¡A¦³§¹¾ãªºprogram code¡A¥H¤Î²Ó³¡°õ¦æªº±¡§Î)
Atsuyuki Okabe,    Barry Boots,    Kokichi Sugihara and Sung Nok Chiu  "Spatial Tessellations : Concepts and Applications of Voronoi Diagrams"

¨ä¥L°Ñ¦Ò¸ê®Æ©Î¤å³¹
¡]¤U¦C¤å³¹§¡¬°³q«U©Ê¤¶²Ð¡A¾A¦X©Ò¦³²z¤u­I´ºªÌ¾\Ū¡^
¶g´Á«H¸¹ªºÅ]³N®v¡]³Å¥ß¸­¯Å¼Æ²L½Í¡^     ªL®e§ü
ºtºâªkªº½ÆÂø«×-®É¶¡»Pµ²ªGªº¦Ò¶q    ¼B¬³®Ô,ÁºÕèb
¤ñº¸»\¯÷¦b¤j¾ÇùةҼgªº½×¤å       ªLÄ£¹a
NP-Completeness²¤¶      ªL§®Áo
³Å¸­º¸(Fourier Transform)      §õ®a¦P

BBS°Q½×°Ï
¤¤¤s¤j¾Ç¦èÆWBBS¯¸½Òµ{ª©--¸ê¤u©Òºtºâªk
¤¤¤s¤j¾Ç¦èÆWBBS¯¸½Òµ{ª©--¸ê¤u©Òºtºâªk¡]ºëµØ°Ï¡^