Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

Dept: Computer Science and Engineering  Dates: 2005 – 2009

You searched for subject:(lattice concept algorithm Jester Movielens). Showing records 1 – 30 of 30 total matches.

Search Limiters

Last 2 Years | English Only

Degrees

▼ Search Limiters


NSYSU

1. Weng, Hsiang-yi. A Hybrid Algorithm for the Longest Common Subsequence of Multiple Sequences.

Degree: Master, Computer Science and Engineering, 2009, NSYSU

 The k-LCS problem is to find the longest common subsequence (LCS) of k input sequences. It is difficult while the number of input sequences is… (more)

Subjects/Keywords: Ant Colony Optimization Algorithm; genetic algorithm; longest common subsequence

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Weng, H. (2009). A Hybrid Algorithm for the Longest Common Subsequence of Multiple Sequences. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0819109-141733

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Weng, Hsiang-yi. “A Hybrid Algorithm for the Longest Common Subsequence of Multiple Sequences.” 2009. Thesis, NSYSU. Accessed July 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0819109-141733.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Weng, Hsiang-yi. “A Hybrid Algorithm for the Longest Common Subsequence of Multiple Sequences.” 2009. Web. 21 Jul 2019.

Vancouver:

Weng H. A Hybrid Algorithm for the Longest Common Subsequence of Multiple Sequences. [Internet] [Thesis]. NSYSU; 2009. [cited 2019 Jul 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0819109-141733.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Weng H. A Hybrid Algorithm for the Longest Common Subsequence of Multiple Sequences. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0819109-141733

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

2. Tseng, Kuo-Tsung. Algorithms for Near-optimal Alignment Problems on Biosequences.

Degree: PhD, Computer Science and Engineering, 2008, NSYSU

 With the improvement of biological techniques, the amount of biosequences data, such as DNA, RNA and protein sequences, are growing explosively. It is almost impossible… (more)

Subjects/Keywords: LCS; protein; biosequence; algorithm; near-optimal

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Tseng, K. (2008). Algorithms for Near-optimal Alignment Problems on Biosequences. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0826108-182735

Chicago Manual of Style (16th Edition):

Tseng, Kuo-Tsung. “Algorithms for Near-optimal Alignment Problems on Biosequences.” 2008. Doctoral Dissertation, NSYSU. Accessed July 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0826108-182735.

MLA Handbook (7th Edition):

Tseng, Kuo-Tsung. “Algorithms for Near-optimal Alignment Problems on Biosequences.” 2008. Web. 21 Jul 2019.

Vancouver:

Tseng K. Algorithms for Near-optimal Alignment Problems on Biosequences. [Internet] [Doctoral dissertation]. NSYSU; 2008. [cited 2019 Jul 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0826108-182735.

Council of Science Editors:

Tseng K. Algorithms for Near-optimal Alignment Problems on Biosequences. [Doctoral Dissertation]. NSYSU; 2008. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0826108-182735


NSYSU

3. Chen, Ming-cheng. A GA-Fuzzy-Based Voting Mechanism for Microarray Data Classification.

Degree: Master, Computer Science and Engineering, 2008, NSYSU

 The microarray technology plays an important role of clinical oncology field. The patient can be diagnosed a symptom about cancer through microarray data. Currently, to… (more)

Subjects/Keywords: Microarray Data Classification; Genetic Algorithm; Fuzzy Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chen, M. (2008). A GA-Fuzzy-Based Voting Mechanism for Microarray Data Classification. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0930108-105834

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chen, Ming-cheng. “A GA-Fuzzy-Based Voting Mechanism for Microarray Data Classification.” 2008. Thesis, NSYSU. Accessed July 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0930108-105834.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chen, Ming-cheng. “A GA-Fuzzy-Based Voting Mechanism for Microarray Data Classification.” 2008. Web. 21 Jul 2019.

Vancouver:

Chen M. A GA-Fuzzy-Based Voting Mechanism for Microarray Data Classification. [Internet] [Thesis]. NSYSU; 2008. [cited 2019 Jul 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0930108-105834.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chen M. A GA-Fuzzy-Based Voting Mechanism for Microarray Data Classification. [Thesis]. NSYSU; 2008. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0930108-105834

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

4. Wu, De-kai. A Heuristic Algorithm for Maximizing Lifetime in Sensor Network.

Degree: Master, Computer Science and Engineering, 2009, NSYSU

 Wireless sensor network has applications in environmental surveillance, healthcare, and military operations. Because the energy of sensor nodes is limited and nodes are unable to… (more)

Subjects/Keywords: Heuristic Algorithm; Wireless Sensor Network; Lifetime

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wu, D. (2009). A Heuristic Algorithm for Maximizing Lifetime in Sensor Network. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0715109-154428

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Wu, De-kai. “A Heuristic Algorithm for Maximizing Lifetime in Sensor Network.” 2009. Thesis, NSYSU. Accessed July 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0715109-154428.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wu, De-kai. “A Heuristic Algorithm for Maximizing Lifetime in Sensor Network.” 2009. Web. 21 Jul 2019.

Vancouver:

Wu D. A Heuristic Algorithm for Maximizing Lifetime in Sensor Network. [Internet] [Thesis]. NSYSU; 2009. [cited 2019 Jul 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0715109-154428.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wu D. A Heuristic Algorithm for Maximizing Lifetime in Sensor Network. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0715109-154428

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

5. Lu, Yi-shan. Efficient Implementation of the Weil Pairing.

Degree: Master, Computer Science and Engineering, 2009, NSYSU

 The most efficient algorithm for solving the elliptic curve discrete logarithm problem can only be done in exponential time. Hence, we can use it in… (more)

Subjects/Keywords: Miller's algorithm; Weil Pairing; Elliptic Curve

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lu, Y. (2009). Efficient Implementation of the Weil Pairing. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0831109-235209

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lu, Yi-shan. “Efficient Implementation of the Weil Pairing.” 2009. Thesis, NSYSU. Accessed July 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0831109-235209.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lu, Yi-shan. “Efficient Implementation of the Weil Pairing.” 2009. Web. 21 Jul 2019.

Vancouver:

Lu Y. Efficient Implementation of the Weil Pairing. [Internet] [Thesis]. NSYSU; 2009. [cited 2019 Jul 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0831109-235209.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lu Y. Efficient Implementation of the Weil Pairing. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0831109-235209

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

6. Chou, Yan-Chi. Style Music Accompaniment Using a Variable-length Genetic Algorithm with Chord Progression.

Degree: Master, Computer Science and Engineering, 2009, NSYSU

 The domain of computer music is an interesting area which combines computer science and music art. We propose a music accompaniment system using a variable-length… (more)

Subjects/Keywords: Chord Progression; Accompaniment; Variable-length Genetic Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chou, Y. (2009). Style Music Accompaniment Using a Variable-length Genetic Algorithm with Chord Progression. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0910109-163344

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chou, Yan-Chi. “Style Music Accompaniment Using a Variable-length Genetic Algorithm with Chord Progression.” 2009. Thesis, NSYSU. Accessed July 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0910109-163344.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chou, Yan-Chi. “Style Music Accompaniment Using a Variable-length Genetic Algorithm with Chord Progression.” 2009. Web. 21 Jul 2019.

Vancouver:

Chou Y. Style Music Accompaniment Using a Variable-length Genetic Algorithm with Chord Progression. [Internet] [Thesis]. NSYSU; 2009. [cited 2019 Jul 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0910109-163344.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chou Y. Style Music Accompaniment Using a Variable-length Genetic Algorithm with Chord Progression. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0910109-163344

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

7. Chiang, Chung-Han. A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences.

Degree: Master, Computer Science and Engineering, 2009, NSYSU

 Various approaches have been proposed for finding the longest common subsequence (LCS) of two sequences. The time complexities of these algorithms are usually O(n2) in… (more)

Subjects/Keywords: longest common subsequence; multiple sequences; genetic algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chiang, C. (2009). A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0106109-080018

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chiang, Chung-Han. “A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences.” 2009. Thesis, NSYSU. Accessed July 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0106109-080018.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chiang, Chung-Han. “A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences.” 2009. Web. 21 Jul 2019.

Vancouver:

Chiang C. A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences. [Internet] [Thesis]. NSYSU; 2009. [cited 2019 Jul 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0106109-080018.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chiang C. A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0106109-080018

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

8. Wang, Chia-Chang. Protein Structure Prediction Based on the Sliced Lattice Model.

Degree: Master, Computer Science and Engineering, 2005, NSYSU

 Functional expression of a protein in life form is decided by its tertiary structure. In the past few decades, a significant number of studies have… (more)

Subjects/Keywords: Sliced lattice; Protein structure; Folding; Ant colony system; Prediction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wang, C. (2005). Protein Structure Prediction Based on the Sliced Lattice Model. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0711105-161914

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Wang, Chia-Chang. “Protein Structure Prediction Based on the Sliced Lattice Model.” 2005. Thesis, NSYSU. Accessed July 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0711105-161914.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wang, Chia-Chang. “Protein Structure Prediction Based on the Sliced Lattice Model.” 2005. Web. 21 Jul 2019.

Vancouver:

Wang C. Protein Structure Prediction Based on the Sliced Lattice Model. [Internet] [Thesis]. NSYSU; 2005. [cited 2019 Jul 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0711105-161914.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang C. Protein Structure Prediction Based on the Sliced Lattice Model. [Thesis]. NSYSU; 2005. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0711105-161914

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

9. Sie, Kun-Sian. Sim-paramecium Evolution Algorithm based on Enhanced Livability and Competition.

Degree: Master, Computer Science and Engineering, 2007, NSYSU

 This thesis proposes an algorithm to enhance the convergence speed of genetic algorithm by modifying the function flow of a simple GA. Additional operators, such… (more)

Subjects/Keywords: genetic algorithm; competition; asexual reproduction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sie, K. (2007). Sim-paramecium Evolution Algorithm based on Enhanced Livability and Competition. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0816107-122142

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sie, Kun-Sian. “Sim-paramecium Evolution Algorithm based on Enhanced Livability and Competition.” 2007. Thesis, NSYSU. Accessed July 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0816107-122142.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sie, Kun-Sian. “Sim-paramecium Evolution Algorithm based on Enhanced Livability and Competition.” 2007. Web. 21 Jul 2019.

Vancouver:

Sie K. Sim-paramecium Evolution Algorithm based on Enhanced Livability and Competition. [Internet] [Thesis]. NSYSU; 2007. [cited 2019 Jul 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0816107-122142.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sie K. Sim-paramecium Evolution Algorithm based on Enhanced Livability and Competition. [Thesis]. NSYSU; 2007. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0816107-122142

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

10. Chou, Ta-Yuan. Method of Inequalities Based Multiobjective Genetic Algorithm for Airline Scheduling Problems.

Degree: PhD, Computer Science and Engineering, 2008, NSYSU

 In airline industry scheduling problems, the aircraft routing and the aircrew pairing problems are highly related to fueling and personnel costs. When performing aircraft routing… (more)

Subjects/Keywords: Multiobjective; Optimization; Genetic Algorithm; Method of Inequalities; Scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chou, T. (2008). Method of Inequalities Based Multiobjective Genetic Algorithm for Airline Scheduling Problems. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0214108-174718

Chicago Manual of Style (16th Edition):

Chou, Ta-Yuan. “Method of Inequalities Based Multiobjective Genetic Algorithm for Airline Scheduling Problems.” 2008. Doctoral Dissertation, NSYSU. Accessed July 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0214108-174718.

MLA Handbook (7th Edition):

Chou, Ta-Yuan. “Method of Inequalities Based Multiobjective Genetic Algorithm for Airline Scheduling Problems.” 2008. Web. 21 Jul 2019.

Vancouver:

Chou T. Method of Inequalities Based Multiobjective Genetic Algorithm for Airline Scheduling Problems. [Internet] [Doctoral dissertation]. NSYSU; 2008. [cited 2019 Jul 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0214108-174718.

Council of Science Editors:

Chou T. Method of Inequalities Based Multiobjective Genetic Algorithm for Airline Scheduling Problems. [Doctoral Dissertation]. NSYSU; 2008. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0214108-174718


NSYSU

11. Chiu, Chiao-Wei. A Fault-Tolerant Routing Algorithm with Probabilistic Safety Vectors on the (n, k)-star Graph.

Degree: Master, Computer Science and Engineering, 2008, NSYSU

 In this thesis, we focus on the design of the fault-tolerant routing algorithm for the (n, k)-star graph. We apply the idea of collecting the… (more)

Subjects/Keywords: Fault-Tolerant Routing Algorithm; (n k)-star Graph; Probabilistic Safety Vector

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chiu, C. (2008). A Fault-Tolerant Routing Algorithm with Probabilistic Safety Vectors on the (n, k)-star Graph. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0903108-161000

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chiu, Chiao-Wei. “A Fault-Tolerant Routing Algorithm with Probabilistic Safety Vectors on the (n, k)-star Graph.” 2008. Thesis, NSYSU. Accessed July 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0903108-161000.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chiu, Chiao-Wei. “A Fault-Tolerant Routing Algorithm with Probabilistic Safety Vectors on the (n, k)-star Graph.” 2008. Web. 21 Jul 2019.

Vancouver:

Chiu C. A Fault-Tolerant Routing Algorithm with Probabilistic Safety Vectors on the (n, k)-star Graph. [Internet] [Thesis]. NSYSU; 2008. [cited 2019 Jul 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0903108-161000.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chiu C. A Fault-Tolerant Routing Algorithm with Probabilistic Safety Vectors on the (n, k)-star Graph. [Thesis]. NSYSU; 2008. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0903108-161000

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

12. Huang, Cheng-Kai. Heterogeneous Wireless Transmitter Placement with Multiple Constraints Based on the Variable-Length Multiobjective Genetic Algorithm.

Degree: Master, Computer Science and Engineering, 2008, NSYSU

 In this thesis we have proposed a variable-length multiobjective genetic algorithm to solve heterogeneous wireless transmitter placement with multiple constraints. Among many factors that may… (more)

Subjects/Keywords: Wireless Transmitter Placement; Variable-Length Multiobjective Genetic Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Huang, C. (2008). Heterogeneous Wireless Transmitter Placement with Multiple Constraints Based on the Variable-Length Multiobjective Genetic Algorithm. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1120108-183839

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Huang, Cheng-Kai. “Heterogeneous Wireless Transmitter Placement with Multiple Constraints Based on the Variable-Length Multiobjective Genetic Algorithm.” 2008. Thesis, NSYSU. Accessed July 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1120108-183839.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Huang, Cheng-Kai. “Heterogeneous Wireless Transmitter Placement with Multiple Constraints Based on the Variable-Length Multiobjective Genetic Algorithm.” 2008. Web. 21 Jul 2019.

Vancouver:

Huang C. Heterogeneous Wireless Transmitter Placement with Multiple Constraints Based on the Variable-Length Multiobjective Genetic Algorithm. [Internet] [Thesis]. NSYSU; 2008. [cited 2019 Jul 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1120108-183839.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Huang C. Heterogeneous Wireless Transmitter Placement with Multiple Constraints Based on the Variable-Length Multiobjective Genetic Algorithm. [Thesis]. NSYSU; 2008. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1120108-183839

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

13. Lin, Keng-Hsien. Design of an Efficient Clipping Engine for OpenGL-ES 2.0 Vertex Shaders in 3D Graphics Systems.

Degree: Master, Computer Science and Engineering, 2009, NSYSU

 In computer graphics technique, the 3D graphic pipeline flow has two processing modules: Geometry module and Rendering module. The geometry module supports vertex coordinate transformation,… (more)

Subjects/Keywords: Clipping algorithm; 3D graphics; Vertex Shader; OpenGL-ES

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lin, K. (2009). Design of an Efficient Clipping Engine for OpenGL-ES 2.0 Vertex Shaders in 3D Graphics Systems. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0901109-024820

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lin, Keng-Hsien. “Design of an Efficient Clipping Engine for OpenGL-ES 2.0 Vertex Shaders in 3D Graphics Systems.” 2009. Thesis, NSYSU. Accessed July 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0901109-024820.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lin, Keng-Hsien. “Design of an Efficient Clipping Engine for OpenGL-ES 2.0 Vertex Shaders in 3D Graphics Systems.” 2009. Web. 21 Jul 2019.

Vancouver:

Lin K. Design of an Efficient Clipping Engine for OpenGL-ES 2.0 Vertex Shaders in 3D Graphics Systems. [Internet] [Thesis]. NSYSU; 2009. [cited 2019 Jul 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0901109-024820.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lin K. Design of an Efficient Clipping Engine for OpenGL-ES 2.0 Vertex Shaders in 3D Graphics Systems. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0901109-024820

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

14. Chen, Bing-hong. Table Driven Algorithm for Joint Sparse Form.

Degree: Master, Computer Science and Engineering, 2007, NSYSU

 In Cryptography, computing a^xb^y mod n is the most important and the most time-consuming calculation The problem can be solved by classical binary method. Later… (more)

Subjects/Keywords: Sparse Form; Table Driven Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chen, B. (2007). Table Driven Algorithm for Joint Sparse Form. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0825107-171056

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chen, Bing-hong. “Table Driven Algorithm for Joint Sparse Form.” 2007. Thesis, NSYSU. Accessed July 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0825107-171056.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chen, Bing-hong. “Table Driven Algorithm for Joint Sparse Form.” 2007. Web. 21 Jul 2019.

Vancouver:

Chen B. Table Driven Algorithm for Joint Sparse Form. [Internet] [Thesis]. NSYSU; 2007. [cited 2019 Jul 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0825107-171056.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chen B. Table Driven Algorithm for Joint Sparse Form. [Thesis]. NSYSU; 2007. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0825107-171056

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

15. Chen, Shiuan-wen. Algorithms for the Traffic Light Setting Problem on the Graph Model.

Degree: Master, Computer Science and Engineering, 2007, NSYSU

 As the number of vehicles increases rapidly, traffic congestion has become a serious problem in a city. Over the past years, a considerable number of… (more)

Subjects/Keywords: graph model; algorithm; traffic light

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chen, S. (2007). Algorithms for the Traffic Light Setting Problem on the Graph Model. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0828107-073809

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chen, Shiuan-wen. “Algorithms for the Traffic Light Setting Problem on the Graph Model.” 2007. Thesis, NSYSU. Accessed July 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0828107-073809.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chen, Shiuan-wen. “Algorithms for the Traffic Light Setting Problem on the Graph Model.” 2007. Web. 21 Jul 2019.

Vancouver:

Chen S. Algorithms for the Traffic Light Setting Problem on the Graph Model. [Internet] [Thesis]. NSYSU; 2007. [cited 2019 Jul 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0828107-073809.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chen S. Algorithms for the Traffic Light Setting Problem on the Graph Model. [Thesis]. NSYSU; 2007. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0828107-073809

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

16. Pan, Chin-Ju. Parameter Tuning of Microstrip Antennas Design using Genetic Algorithm.

Degree: PhD, Computer Science and Engineering, 2006, NSYSU

 In recent years, microstrip antennas are suitable for applications in wireless communication systems because they have the characteristics of compact size, light weight, low cost… (more)

Subjects/Keywords: Microstrip antennas; Optimization; Genetic Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pan, C. (2006). Parameter Tuning of Microstrip Antennas Design using Genetic Algorithm. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1020106-170717

Chicago Manual of Style (16th Edition):

Pan, Chin-Ju. “Parameter Tuning of Microstrip Antennas Design using Genetic Algorithm.” 2006. Doctoral Dissertation, NSYSU. Accessed July 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1020106-170717.

MLA Handbook (7th Edition):

Pan, Chin-Ju. “Parameter Tuning of Microstrip Antennas Design using Genetic Algorithm.” 2006. Web. 21 Jul 2019.

Vancouver:

Pan C. Parameter Tuning of Microstrip Antennas Design using Genetic Algorithm. [Internet] [Doctoral dissertation]. NSYSU; 2006. [cited 2019 Jul 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1020106-170717.

Council of Science Editors:

Pan C. Parameter Tuning of Microstrip Antennas Design using Genetic Algorithm. [Doctoral Dissertation]. NSYSU; 2006. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1020106-170717


University of Notre Dame

17. Shawn Thomas O'Neil. Expert Advice and the Newsvendor Problem</h1>.

Degree: MSin Computer Science and Engineering, Computer Science and Engineering, 2009, University of Notre Dame

  The multi-period newsvendor problem describes the newspaper salesman’s dilemma—how many papers should he purchase each day to resell, when he doesn’t know the demand?… (more)

Subjects/Keywords: newsvendor; weighted majority; newsboy; online; algorithm; expert advice

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

O'Neil, S. T. (2009). Expert Advice and the Newsvendor Problem</h1>. (Masters Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/3484zg66n9k

Chicago Manual of Style (16th Edition):

O'Neil, Shawn Thomas. “Expert Advice and the Newsvendor Problem</h1>.” 2009. Masters Thesis, University of Notre Dame. Accessed July 21, 2019. https://curate.nd.edu/show/3484zg66n9k.

MLA Handbook (7th Edition):

O'Neil, Shawn Thomas. “Expert Advice and the Newsvendor Problem</h1>.” 2009. Web. 21 Jul 2019.

Vancouver:

O'Neil ST. Expert Advice and the Newsvendor Problem</h1>. [Internet] [Masters thesis]. University of Notre Dame; 2009. [cited 2019 Jul 21]. Available from: https://curate.nd.edu/show/3484zg66n9k.

Council of Science Editors:

O'Neil ST. Expert Advice and the Newsvendor Problem</h1>. [Masters Thesis]. University of Notre Dame; 2009. Available from: https://curate.nd.edu/show/3484zg66n9k


NSYSU

18. Chen, Kuan-Mei. Predictive Multicast Polling and Tree Splitting Algorithm in Wireless Access Networks with Multipacket Reception.

Degree: PhD, Computer Science and Engineering, 2009, NSYSU

 In this dissertation, we propose using and analytically evaluate the predictive multicast polling scheme and the tree splitting algorithm for medium access control in interference… (more)

Subjects/Keywords: Wireless LAN; Tree/Stack Splitting Algorithm; Probabilistic Performance Analysis; Multipacket Reception; Medium Access Control

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chen, K. (2009). Predictive Multicast Polling and Tree Splitting Algorithm in Wireless Access Networks with Multipacket Reception. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823109-140341

Chicago Manual of Style (16th Edition):

Chen, Kuan-Mei. “Predictive Multicast Polling and Tree Splitting Algorithm in Wireless Access Networks with Multipacket Reception.” 2009. Doctoral Dissertation, NSYSU. Accessed July 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823109-140341.

MLA Handbook (7th Edition):

Chen, Kuan-Mei. “Predictive Multicast Polling and Tree Splitting Algorithm in Wireless Access Networks with Multipacket Reception.” 2009. Web. 21 Jul 2019.

Vancouver:

Chen K. Predictive Multicast Polling and Tree Splitting Algorithm in Wireless Access Networks with Multipacket Reception. [Internet] [Doctoral dissertation]. NSYSU; 2009. [cited 2019 Jul 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823109-140341.

Council of Science Editors:

Chen K. Predictive Multicast Polling and Tree Splitting Algorithm in Wireless Access Networks with Multipacket Reception. [Doctoral Dissertation]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823109-140341


NSYSU

19. Lin, Fang-lien. Probe Design Using Multi-objective Genetic Algorithm.

Degree: Master, Computer Science and Engineering, 2005, NSYSU

 DNA microarrays are widely used techniques in molecular biology and DNA computing area. Before performing the microarray experiment, a set of subsequences of DNA called… (more)

Subjects/Keywords: multi-objective optimization genetic algorithm; probe design; microarray

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lin, F. (2005). Probe Design Using Multi-objective Genetic Algorithm. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0822105-173022

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lin, Fang-lien. “Probe Design Using Multi-objective Genetic Algorithm.” 2005. Thesis, NSYSU. Accessed July 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0822105-173022.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lin, Fang-lien. “Probe Design Using Multi-objective Genetic Algorithm.” 2005. Web. 21 Jul 2019.

Vancouver:

Lin F. Probe Design Using Multi-objective Genetic Algorithm. [Internet] [Thesis]. NSYSU; 2005. [cited 2019 Jul 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0822105-173022.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lin F. Probe Design Using Multi-objective Genetic Algorithm. [Thesis]. NSYSU; 2005. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0822105-173022

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

20. Chen, Ya-yun. Generating Implicit Functions Model from Triangles Mesh Model by Using Genetic Algorithm.

Degree: Master, Computer Science and Engineering, 2005, NSYSU

 The implicit function model is nowadays generally applied to a lot of fields that need 3D, such as computer game, cartoon or for specially effect… (more)

Subjects/Keywords: Three Dimensional Modeling Transformations; Implicit Functions; Genetic Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chen, Y. (2005). Generating Implicit Functions Model from Triangles Mesh Model by Using Genetic Algorithm. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1009105-101634

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chen, Ya-yun. “Generating Implicit Functions Model from Triangles Mesh Model by Using Genetic Algorithm.” 2005. Thesis, NSYSU. Accessed July 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1009105-101634.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chen, Ya-yun. “Generating Implicit Functions Model from Triangles Mesh Model by Using Genetic Algorithm.” 2005. Web. 21 Jul 2019.

Vancouver:

Chen Y. Generating Implicit Functions Model from Triangles Mesh Model by Using Genetic Algorithm. [Internet] [Thesis]. NSYSU; 2005. [cited 2019 Jul 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1009105-101634.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chen Y. Generating Implicit Functions Model from Triangles Mesh Model by Using Genetic Algorithm. [Thesis]. NSYSU; 2005. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1009105-101634

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

21. Shiau, Shyue-Horng. Partial Sort and Its Applications on Single-Hop Wireless Networks.

Degree: PhD, Computer Science and Engineering, 2006, NSYSU

 In this dissertation, we focus on the study of the partial sorting (generalized sorting) problem and the initialization problem. The partial sorting problem is to… (more)

Subjects/Keywords: partial sort; initialization; parallel algorithm; quicksort; broadcast; insertion sort

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Shiau, S. (2006). Partial Sort and Its Applications on Single-Hop Wireless Networks. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0119106-120724

Chicago Manual of Style (16th Edition):

Shiau, Shyue-Horng. “Partial Sort and Its Applications on Single-Hop Wireless Networks.” 2006. Doctoral Dissertation, NSYSU. Accessed July 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0119106-120724.

MLA Handbook (7th Edition):

Shiau, Shyue-Horng. “Partial Sort and Its Applications on Single-Hop Wireless Networks.” 2006. Web. 21 Jul 2019.

Vancouver:

Shiau S. Partial Sort and Its Applications on Single-Hop Wireless Networks. [Internet] [Doctoral dissertation]. NSYSU; 2006. [cited 2019 Jul 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0119106-120724.

Council of Science Editors:

Shiau S. Partial Sort and Its Applications on Single-Hop Wireless Networks. [Doctoral Dissertation]. NSYSU; 2006. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0119106-120724


Penn State University

22. Hou, Minmei. Algorithms for Aligning and Clustering Genomic Sequences that Contain Duplications.

Degree: PhD, Computer Science and Engineering, 2007, Penn State University

 Genomes of advanced organisms contain numerous repeated sequences, including gene clusters, tandem repeats, interspersed repeats, and segmental duplications. Among these, gene clusters are the class… (more)

Subjects/Keywords: algorithm; genomic sequence; duplication; alignment; homologous; orthologous

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hou, M. (2007). Algorithms for Aligning and Clustering Genomic Sequences that Contain Duplications. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/7838

Chicago Manual of Style (16th Edition):

Hou, Minmei. “Algorithms for Aligning and Clustering Genomic Sequences that Contain Duplications.” 2007. Doctoral Dissertation, Penn State University. Accessed July 21, 2019. https://etda.libraries.psu.edu/catalog/7838.

MLA Handbook (7th Edition):

Hou, Minmei. “Algorithms for Aligning and Clustering Genomic Sequences that Contain Duplications.” 2007. Web. 21 Jul 2019.

Vancouver:

Hou M. Algorithms for Aligning and Clustering Genomic Sequences that Contain Duplications. [Internet] [Doctoral dissertation]. Penn State University; 2007. [cited 2019 Jul 21]. Available from: https://etda.libraries.psu.edu/catalog/7838.

Council of Science Editors:

Hou M. Algorithms for Aligning and Clustering Genomic Sequences that Contain Duplications. [Doctoral Dissertation]. Penn State University; 2007. Available from: https://etda.libraries.psu.edu/catalog/7838


Penn State University

23. Hung, Wei-Lun. Designing Cool Chips: Low Power and Thermal-Aware Design Methodologies.

Degree: PhD, Computer Science and Engineering, 2006, Penn State University

 Power is one of the rigid challenges for high performance computer system designs and for the widespread use of portable and wireless electronic systems. With… (more)

Subjects/Keywords: placement; algorithm; VLSI; CAD; thermal; EDA; floorplanning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hung, W. (2006). Designing Cool Chips: Low Power and Thermal-Aware Design Methodologies. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/7352

Chicago Manual of Style (16th Edition):

Hung, Wei-Lun. “Designing Cool Chips: Low Power and Thermal-Aware Design Methodologies.” 2006. Doctoral Dissertation, Penn State University. Accessed July 21, 2019. https://etda.libraries.psu.edu/catalog/7352.

MLA Handbook (7th Edition):

Hung, Wei-Lun. “Designing Cool Chips: Low Power and Thermal-Aware Design Methodologies.” 2006. Web. 21 Jul 2019.

Vancouver:

Hung W. Designing Cool Chips: Low Power and Thermal-Aware Design Methodologies. [Internet] [Doctoral dissertation]. Penn State University; 2006. [cited 2019 Jul 21]. Available from: https://etda.libraries.psu.edu/catalog/7352.

Council of Science Editors:

Hung W. Designing Cool Chips: Low Power and Thermal-Aware Design Methodologies. [Doctoral Dissertation]. Penn State University; 2006. Available from: https://etda.libraries.psu.edu/catalog/7352


University of Notre Dame

24. Bin Xu. New Algorithms for Spatial Data Clustering Problems</h1>.

Degree: PhD, Computer Science and Engineering, 2008, University of Notre Dame

  Knowledge discovery in spatial (i.e., numerical) data sets is becoming more and more important since increasingly large amounts of spatial data are available and… (more)

Subjects/Keywords: algorithm; computational geometry; data mining; spatial data clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Xu, B. (2008). New Algorithms for Spatial Data Clustering Problems</h1>. (Doctoral Dissertation). University of Notre Dame. Retrieved from https://curate.nd.edu/show/2r36tx33m1x

Chicago Manual of Style (16th Edition):

Xu, Bin. “New Algorithms for Spatial Data Clustering Problems</h1>.” 2008. Doctoral Dissertation, University of Notre Dame. Accessed July 21, 2019. https://curate.nd.edu/show/2r36tx33m1x.

MLA Handbook (7th Edition):

Xu, Bin. “New Algorithms for Spatial Data Clustering Problems</h1>.” 2008. Web. 21 Jul 2019.

Vancouver:

Xu B. New Algorithms for Spatial Data Clustering Problems</h1>. [Internet] [Doctoral dissertation]. University of Notre Dame; 2008. [cited 2019 Jul 21]. Available from: https://curate.nd.edu/show/2r36tx33m1x.

Council of Science Editors:

Xu B. New Algorithms for Spatial Data Clustering Problems</h1>. [Doctoral Dissertation]. University of Notre Dame; 2008. Available from: https://curate.nd.edu/show/2r36tx33m1x


University of Notre Dame

25. Ryan Nicholas Lichtenwalter. Beyond Static Data: Tackling Class Imbalance and Concept Drift in Data Streams, Link Persistence and Prediction in Dynamic Networks, and Autonomous Composition in Computer Music</h1>.

Degree: MSin Computer Science and Engineering, Computer Science and Engineering, 2009, University of Notre Dame

  This thesis tackles the fundamental issues of streaming data in different challenging scenarios. First, the confounding problem of class imbalance and concept drift is… (more)

Subjects/Keywords: stream mining; class imbalance; link prediction; link persistence; data streams; ensembles; schenkerian analysis; concept drift; classification; autonomous composition; social networks; computer music

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lichtenwalter, R. N. (2009). Beyond Static Data: Tackling Class Imbalance and Concept Drift in Data Streams, Link Persistence and Prediction in Dynamic Networks, and Autonomous Composition in Computer Music</h1>. (Masters Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/ws859c70f89

Chicago Manual of Style (16th Edition):

Lichtenwalter, Ryan Nicholas. “Beyond Static Data: Tackling Class Imbalance and Concept Drift in Data Streams, Link Persistence and Prediction in Dynamic Networks, and Autonomous Composition in Computer Music</h1>.” 2009. Masters Thesis, University of Notre Dame. Accessed July 21, 2019. https://curate.nd.edu/show/ws859c70f89.

MLA Handbook (7th Edition):

Lichtenwalter, Ryan Nicholas. “Beyond Static Data: Tackling Class Imbalance and Concept Drift in Data Streams, Link Persistence and Prediction in Dynamic Networks, and Autonomous Composition in Computer Music</h1>.” 2009. Web. 21 Jul 2019.

Vancouver:

Lichtenwalter RN. Beyond Static Data: Tackling Class Imbalance and Concept Drift in Data Streams, Link Persistence and Prediction in Dynamic Networks, and Autonomous Composition in Computer Music</h1>. [Internet] [Masters thesis]. University of Notre Dame; 2009. [cited 2019 Jul 21]. Available from: https://curate.nd.edu/show/ws859c70f89.

Council of Science Editors:

Lichtenwalter RN. Beyond Static Data: Tackling Class Imbalance and Concept Drift in Data Streams, Link Persistence and Prediction in Dynamic Networks, and Autonomous Composition in Computer Music</h1>. [Masters Thesis]. University of Notre Dame; 2009. Available from: https://curate.nd.edu/show/ws859c70f89


NSYSU

26. Chang, Hui-Chun. Wireless Heterogeneous Transmitter Placement Based on the Variable-Length Genetic Algorithm.

Degree: Master, Computer Science and Engineering, 2007, NSYSU

 Wireless network placement of transmitters, such as base stations for 2G and 3G, access points for WLAN, is a NP-hard problem, since many factors have… (more)

Subjects/Keywords: Variable-Length Genetic Algorithm; Wireless Heterogeneous Transmitter Placement; Heterogeneous Wireless Network

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chang, H. (2007). Wireless Heterogeneous Transmitter Placement Based on the Variable-Length Genetic Algorithm. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0828107-153832

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chang, Hui-Chun. “Wireless Heterogeneous Transmitter Placement Based on the Variable-Length Genetic Algorithm.” 2007. Thesis, NSYSU. Accessed July 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0828107-153832.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chang, Hui-Chun. “Wireless Heterogeneous Transmitter Placement Based on the Variable-Length Genetic Algorithm.” 2007. Web. 21 Jul 2019.

Vancouver:

Chang H. Wireless Heterogeneous Transmitter Placement Based on the Variable-Length Genetic Algorithm. [Internet] [Thesis]. NSYSU; 2007. [cited 2019 Jul 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0828107-153832.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chang H. Wireless Heterogeneous Transmitter Placement Based on the Variable-Length Genetic Algorithm. [Thesis]. NSYSU; 2007. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0828107-153832

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

27. Huang, Kuo-Si. Some Common Subsequence Problems of Multiple Sequences and Their Applications.

Degree: PhD, Computer Science and Engineering, 2007, NSYSU

 The longest common subsequence (LCS) problem is a famous and classical problem in computer science and molecular biology. The common subsequence of multiple sequences shows… (more)

Subjects/Keywords: algorithm; multiple sequences; merged sequence; mosaic sequence; longest common subsequence

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Huang, K. (2007). Some Common Subsequence Problems of Multiple Sequences and Their Applications. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0714107-160907

Chicago Manual of Style (16th Edition):

Huang, Kuo-Si. “Some Common Subsequence Problems of Multiple Sequences and Their Applications.” 2007. Doctoral Dissertation, NSYSU. Accessed July 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0714107-160907.

MLA Handbook (7th Edition):

Huang, Kuo-Si. “Some Common Subsequence Problems of Multiple Sequences and Their Applications.” 2007. Web. 21 Jul 2019.

Vancouver:

Huang K. Some Common Subsequence Problems of Multiple Sequences and Their Applications. [Internet] [Doctoral dissertation]. NSYSU; 2007. [cited 2019 Jul 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0714107-160907.

Council of Science Editors:

Huang K. Some Common Subsequence Problems of Multiple Sequences and Their Applications. [Doctoral Dissertation]. NSYSU; 2007. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0714107-160907


NSYSU

28. Huang, Erh-chien. Exon Primers Design Using Multiobjective Genetic Algorithm.

Degree: Master, Computer Science and Engineering, 2005, NSYSU

 Exons are expression DNA sequences. A DNA sequence which includes gene has exons and introns. During transcription and translation, introns will be removed, and exons… (more)

Subjects/Keywords: Multiobjective Optimization Genetic Algorithm; Exon Primer Design; Polymerase Chain Reaction (PCR)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Huang, E. (2005). Exon Primers Design Using Multiobjective Genetic Algorithm. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0829105-165900

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Huang, Erh-chien. “Exon Primers Design Using Multiobjective Genetic Algorithm.” 2005. Thesis, NSYSU. Accessed July 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0829105-165900.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Huang, Erh-chien. “Exon Primers Design Using Multiobjective Genetic Algorithm.” 2005. Web. 21 Jul 2019.

Vancouver:

Huang E. Exon Primers Design Using Multiobjective Genetic Algorithm. [Internet] [Thesis]. NSYSU; 2005. [cited 2019 Jul 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0829105-165900.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Huang E. Exon Primers Design Using Multiobjective Genetic Algorithm. [Thesis]. NSYSU; 2005. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0829105-165900

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

29. Tsai, Yi-Chun. Using Enhanced Weighted Voronoi Diagram for Mobile Service Positioning System.

Degree: Master, Computer Science and Engineering, 2005, NSYSU

 The objective of this thesis is to design a mobile positioning system on the premise that low system complexity and less modification of components of… (more)

Subjects/Keywords: EWVD Algorithm; weighted Voronoi diagram; cellular positioning; path loss; signal strength

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Tsai, Y. (2005). Using Enhanced Weighted Voronoi Diagram for Mobile Service Positioning System. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0905105-130625

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Tsai, Yi-Chun. “Using Enhanced Weighted Voronoi Diagram for Mobile Service Positioning System.” 2005. Thesis, NSYSU. Accessed July 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0905105-130625.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Tsai, Yi-Chun. “Using Enhanced Weighted Voronoi Diagram for Mobile Service Positioning System.” 2005. Web. 21 Jul 2019.

Vancouver:

Tsai Y. Using Enhanced Weighted Voronoi Diagram for Mobile Service Positioning System. [Internet] [Thesis]. NSYSU; 2005. [cited 2019 Jul 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0905105-130625.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tsai Y. Using Enhanced Weighted Voronoi Diagram for Mobile Service Positioning System. [Thesis]. NSYSU; 2005. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0905105-130625

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Notre Dame

30. Chao Wang. New Algorithms for Treatment Planning and Delivery Problems in Intensity-Modulated Radiation Therapy</h1>.

Degree: PhD, Computer Science and Engineering, 2007, University of Notre Dame

  Intensity-modulated radiation therapy (IMRT) is a modern cancer treatment technique aiming to deliver a prescribed conformal radiation dose to a target tumor while sparing… (more)

Subjects/Keywords: shape rectangularization; IMRT; coupled path planning; static leaf sequencing; field splitting; algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wang, C. (2007). New Algorithms for Treatment Planning and Delivery Problems in Intensity-Modulated Radiation Therapy</h1>. (Doctoral Dissertation). University of Notre Dame. Retrieved from https://curate.nd.edu/show/3197xk83f5r

Chicago Manual of Style (16th Edition):

Wang, Chao. “New Algorithms for Treatment Planning and Delivery Problems in Intensity-Modulated Radiation Therapy</h1>.” 2007. Doctoral Dissertation, University of Notre Dame. Accessed July 21, 2019. https://curate.nd.edu/show/3197xk83f5r.

MLA Handbook (7th Edition):

Wang, Chao. “New Algorithms for Treatment Planning and Delivery Problems in Intensity-Modulated Radiation Therapy</h1>.” 2007. Web. 21 Jul 2019.

Vancouver:

Wang C. New Algorithms for Treatment Planning and Delivery Problems in Intensity-Modulated Radiation Therapy</h1>. [Internet] [Doctoral dissertation]. University of Notre Dame; 2007. [cited 2019 Jul 21]. Available from: https://curate.nd.edu/show/3197xk83f5r.

Council of Science Editors:

Wang C. New Algorithms for Treatment Planning and Delivery Problems in Intensity-Modulated Radiation Therapy</h1>. [Doctoral Dissertation]. University of Notre Dame; 2007. Available from: https://curate.nd.edu/show/3197xk83f5r

.