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

You searched for subject:(Heuristic algorithm). Showing records 1 – 30 of 119 total matches.

[1] [2] [3] [4]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters

1. Rajinikanth V. Heuristic algorithm based identification and controller design for a class of unstable systems;.

Degree: Heuristic algorithm based identification and controller design, 2014, Anna University

newline Nonlinear process loops such as continuous stirred tank reactor, newlineexothermic stirred reactors with back mixing, biochemical reactor, and newlinepolymerization reactors are extensively used in… (more)

Subjects/Keywords: Electrical engineering; Heuristic algorithm

Page 1

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

V, R. (2014). Heuristic algorithm based identification and controller design for a class of unstable systems;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/16439

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):

V, Rajinikanth. “Heuristic algorithm based identification and controller design for a class of unstable systems;.” 2014. Thesis, Anna University. Accessed September 20, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/16439.

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

MLA Handbook (7th Edition):

V, Rajinikanth. “Heuristic algorithm based identification and controller design for a class of unstable systems;.” 2014. Web. 20 Sep 2019.

Vancouver:

V R. Heuristic algorithm based identification and controller design for a class of unstable systems;. [Internet] [Thesis]. Anna University; 2014. [cited 2019 Sep 20]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/16439.

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

Council of Science Editors:

V R. Heuristic algorithm based identification and controller design for a class of unstable systems;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/16439

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


University of Newcastle

2. Wang, Peng. A smart experience-based knowledge analysis system (SEKAS).

Degree: PhD, 2014, University of Newcastle

Research Doctorate - Doctor of Philosophy (PhD)

This thesis addresses issues associated with using ever-increasing amounts of information and knowledge more effectively, and taking advantage… (more)

Subjects/Keywords: knowledge management; evolutionary algorithm; heuristic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, P. (2014). A smart experience-based knowledge analysis system (SEKAS). (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1054153

Chicago Manual of Style (16th Edition):

Wang, Peng. “A smart experience-based knowledge analysis system (SEKAS).” 2014. Doctoral Dissertation, University of Newcastle. Accessed September 20, 2019. http://hdl.handle.net/1959.13/1054153.

MLA Handbook (7th Edition):

Wang, Peng. “A smart experience-based knowledge analysis system (SEKAS).” 2014. Web. 20 Sep 2019.

Vancouver:

Wang P. A smart experience-based knowledge analysis system (SEKAS). [Internet] [Doctoral dissertation]. University of Newcastle; 2014. [cited 2019 Sep 20]. Available from: http://hdl.handle.net/1959.13/1054153.

Council of Science Editors:

Wang P. A smart experience-based knowledge analysis system (SEKAS). [Doctoral Dissertation]. University of Newcastle; 2014. Available from: http://hdl.handle.net/1959.13/1054153


NSYSU

3. 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 September 20, 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. 20 Sep 2019.

Vancouver:

Wu D. A Heuristic Algorithm for Maximizing Lifetime in Sensor Network. [Internet] [Thesis]. NSYSU; 2009. [cited 2019 Sep 20]. 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


Delft University of Technology

4. Pan, Z. Optimization on Burst Allocation in D2DWRAN:.

Degree: 2014, Delft University of Technology

 With rapid development of digital devices with wireless services, communication networks play a significant role in our daily lives. The explosive data demand makes it… (more)

Subjects/Keywords: D2DWRAN; IEEE 802.22; OFDMA; Heuristic Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pan, Z. (2014). Optimization on Burst Allocation in D2DWRAN:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:09344b36-3d46-466e-b7dd-9912c41f004b

Chicago Manual of Style (16th Edition):

Pan, Z. “Optimization on Burst Allocation in D2DWRAN:.” 2014. Masters Thesis, Delft University of Technology. Accessed September 20, 2019. http://resolver.tudelft.nl/uuid:09344b36-3d46-466e-b7dd-9912c41f004b.

MLA Handbook (7th Edition):

Pan, Z. “Optimization on Burst Allocation in D2DWRAN:.” 2014. Web. 20 Sep 2019.

Vancouver:

Pan Z. Optimization on Burst Allocation in D2DWRAN:. [Internet] [Masters thesis]. Delft University of Technology; 2014. [cited 2019 Sep 20]. Available from: http://resolver.tudelft.nl/uuid:09344b36-3d46-466e-b7dd-9912c41f004b.

Council of Science Editors:

Pan Z. Optimization on Burst Allocation in D2DWRAN:. [Masters Thesis]. Delft University of Technology; 2014. Available from: http://resolver.tudelft.nl/uuid:09344b36-3d46-466e-b7dd-9912c41f004b


NSYSU

5. Song, Huei-jyun. A Hyper-Heuristic Clustering Algorithm.

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

 The so-called heuristics have been widely used in solving combinatorial optimization problems because they provide a simple but effective way to find an approximate solution.… (more)

Subjects/Keywords: diversified detection; metaheuristics algorithm; clustering problem; Hyper-heuristic algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Song, H. (2012). A Hyper-Heuristic Clustering Algorithm. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0907112-211759

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):

Song, Huei-jyun. “A Hyper-Heuristic Clustering Algorithm.” 2012. Thesis, NSYSU. Accessed September 20, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0907112-211759.

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

MLA Handbook (7th Edition):

Song, Huei-jyun. “A Hyper-Heuristic Clustering Algorithm.” 2012. Web. 20 Sep 2019.

Vancouver:

Song H. A Hyper-Heuristic Clustering Algorithm. [Internet] [Thesis]. NSYSU; 2012. [cited 2019 Sep 20]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0907112-211759.

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

Council of Science Editors:

Song H. A Hyper-Heuristic Clustering Algorithm. [Thesis]. NSYSU; 2012. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0907112-211759

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

6. Hossain, Mohammad Forhad. Spanning Tree Approach On The Snow Cleaning Problem.

Degree: Computer Engineering, 2010, Dalarna University

  Snow cleaning is one of the important tasks in the winter time in Sweden. Every year government spends huge amount money for snow cleaning… (more)

Subjects/Keywords: Snow Cleaning; Minimum Spanning Tree; Heuristic; prim’s algorithm; Greedy Algorithm.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hossain, M. F. (2010). Spanning Tree Approach On The Snow Cleaning Problem. (Thesis). Dalarna University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847

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):

Hossain, Mohammad Forhad. “Spanning Tree Approach On The Snow Cleaning Problem.” 2010. Thesis, Dalarna University. Accessed September 20, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847.

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

MLA Handbook (7th Edition):

Hossain, Mohammad Forhad. “Spanning Tree Approach On The Snow Cleaning Problem.” 2010. Web. 20 Sep 2019.

Vancouver:

Hossain MF. Spanning Tree Approach On The Snow Cleaning Problem. [Internet] [Thesis]. Dalarna University; 2010. [cited 2019 Sep 20]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847.

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

Council of Science Editors:

Hossain MF. Spanning Tree Approach On The Snow Cleaning Problem. [Thesis]. Dalarna University; 2010. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847

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


NSYSU

7. Yang, You-Chuan. A NewGreedy Genetic Algorithm for Influence Maximization in Social Network.

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

 With the advance of computer and internet technologies, social networks have become an integral part of most peopleâs life. People can now use social networks… (more)

Subjects/Keywords: influence maximization problem; social network; meta-heuristic algorithm; genetic algorithm; NewGreedy algorithm; propagation model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, Y. (2016). A NewGreedy Genetic Algorithm for Influence Maximization in Social Network. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0115116-163418

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):

Yang, You-Chuan. “A NewGreedy Genetic Algorithm for Influence Maximization in Social Network.” 2016. Thesis, NSYSU. Accessed September 20, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0115116-163418.

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

MLA Handbook (7th Edition):

Yang, You-Chuan. “A NewGreedy Genetic Algorithm for Influence Maximization in Social Network.” 2016. Web. 20 Sep 2019.

Vancouver:

Yang Y. A NewGreedy Genetic Algorithm for Influence Maximization in Social Network. [Internet] [Thesis]. NSYSU; 2016. [cited 2019 Sep 20]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0115116-163418.

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

Council of Science Editors:

Yang Y. A NewGreedy Genetic Algorithm for Influence Maximization in Social Network. [Thesis]. NSYSU; 2016. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0115116-163418

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


Brunel University

8. Woodside-Oriakhi, Maria. Portfolio optimisation with transaction cost.

Degree: PhD, 2011, Brunel University

 Portfolio selection is an example of decision making under conditions of uncertainty. In the face of an unknown future, fund managers make complex financial choices… (more)

Subjects/Keywords: Heuristic algorithms; Genetic algorithm; Tabu search; Simulated anealing; Optimal solutions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Woodside-Oriakhi, M. (2011). Portfolio optimisation with transaction cost. (Doctoral Dissertation). Brunel University. Retrieved from http://bura.brunel.ac.uk/handle/2438/5839 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.539924

Chicago Manual of Style (16th Edition):

Woodside-Oriakhi, Maria. “Portfolio optimisation with transaction cost.” 2011. Doctoral Dissertation, Brunel University. Accessed September 20, 2019. http://bura.brunel.ac.uk/handle/2438/5839 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.539924.

MLA Handbook (7th Edition):

Woodside-Oriakhi, Maria. “Portfolio optimisation with transaction cost.” 2011. Web. 20 Sep 2019.

Vancouver:

Woodside-Oriakhi M. Portfolio optimisation with transaction cost. [Internet] [Doctoral dissertation]. Brunel University; 2011. [cited 2019 Sep 20]. Available from: http://bura.brunel.ac.uk/handle/2438/5839 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.539924.

Council of Science Editors:

Woodside-Oriakhi M. Portfolio optimisation with transaction cost. [Doctoral Dissertation]. Brunel University; 2011. Available from: http://bura.brunel.ac.uk/handle/2438/5839 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.539924


NSYSU

9. Chiang, Meng-hsiu. A Framework for the Implementation of Heuristic-based Schedulers on Hadoop.

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

 The advance of computer technology from uni-processing to symmetric-multiprocessing to distributed computing and then to cloud computing has made it more and more difficult to… (more)

Subjects/Keywords: distributed computing; heuristic algorithm; cloud computing; Hadoop; scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chiang, M. (2014). A Framework for the Implementation of Heuristic-based Schedulers on Hadoop. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0720114-145150

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, Meng-hsiu. “A Framework for the Implementation of Heuristic-based Schedulers on Hadoop.” 2014. Thesis, NSYSU. Accessed September 20, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0720114-145150.

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

MLA Handbook (7th Edition):

Chiang, Meng-hsiu. “A Framework for the Implementation of Heuristic-based Schedulers on Hadoop.” 2014. Web. 20 Sep 2019.

Vancouver:

Chiang M. A Framework for the Implementation of Heuristic-based Schedulers on Hadoop. [Internet] [Thesis]. NSYSU; 2014. [cited 2019 Sep 20]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0720114-145150.

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

Council of Science Editors:

Chiang M. A Framework for the Implementation of Heuristic-based Schedulers on Hadoop. [Thesis]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0720114-145150

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


Penn State University

10. Liu, Qi. A HEURISTIC ALGORITHM FOR A MINIMAX SENSOR LOCATION PROBLEM ALONG A PIECEWISE LINEAR CURVE.

Degree: MS, Industrial Engineering, 2010, Penn State University

 Facility location problems have many practical applications in the fields of urban planning, retail industry, emergency service, etc. A recent variant of this problem that… (more)

Subjects/Keywords: Voronoi diagram; piecewise linear curve; minimax sensor location problem; heuristic algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, Q. (2010). A HEURISTIC ALGORITHM FOR A MINIMAX SENSOR LOCATION PROBLEM ALONG A PIECEWISE LINEAR CURVE. (Masters Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/10036

Chicago Manual of Style (16th Edition):

Liu, Qi. “A HEURISTIC ALGORITHM FOR A MINIMAX SENSOR LOCATION PROBLEM ALONG A PIECEWISE LINEAR CURVE.” 2010. Masters Thesis, Penn State University. Accessed September 20, 2019. https://etda.libraries.psu.edu/catalog/10036.

MLA Handbook (7th Edition):

Liu, Qi. “A HEURISTIC ALGORITHM FOR A MINIMAX SENSOR LOCATION PROBLEM ALONG A PIECEWISE LINEAR CURVE.” 2010. Web. 20 Sep 2019.

Vancouver:

Liu Q. A HEURISTIC ALGORITHM FOR A MINIMAX SENSOR LOCATION PROBLEM ALONG A PIECEWISE LINEAR CURVE. [Internet] [Masters thesis]. Penn State University; 2010. [cited 2019 Sep 20]. Available from: https://etda.libraries.psu.edu/catalog/10036.

Council of Science Editors:

Liu Q. A HEURISTIC ALGORITHM FOR A MINIMAX SENSOR LOCATION PROBLEM ALONG A PIECEWISE LINEAR CURVE. [Masters Thesis]. Penn State University; 2010. Available from: https://etda.libraries.psu.edu/catalog/10036


NSYSU

11. Chang, Wei-lun. An Improved Hyper-Heuristic Clustering Algorithm for Wireless Sensor Networks.

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

 Wireless sensor network (WSN) has been widely used in surveillance and monitoring nowadays. As such, a lot of applications and services are built on it… (more)

Subjects/Keywords: LEACH; Clustering; Evolutionary Computation; Hyper-heuristic Algorithm; Lifetime; Wireless Sensor Network

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chang, W. (2017). An Improved Hyper-Heuristic Clustering Algorithm for Wireless Sensor Networks. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0512117-205105

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, Wei-lun. “An Improved Hyper-Heuristic Clustering Algorithm for Wireless Sensor Networks.” 2017. Thesis, NSYSU. Accessed September 20, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0512117-205105.

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

MLA Handbook (7th Edition):

Chang, Wei-lun. “An Improved Hyper-Heuristic Clustering Algorithm for Wireless Sensor Networks.” 2017. Web. 20 Sep 2019.

Vancouver:

Chang W. An Improved Hyper-Heuristic Clustering Algorithm for Wireless Sensor Networks. [Internet] [Thesis]. NSYSU; 2017. [cited 2019 Sep 20]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0512117-205105.

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

Council of Science Editors:

Chang W. An Improved Hyper-Heuristic Clustering Algorithm for Wireless Sensor Networks. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0512117-205105

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

12. Oyekanlu, Emmanuel Adebomi. Performance Evaluation of an Uplink Scheduling Algorithm in WiMAX Designing the Adaptive Heuristic Uplink Scheduling Algorithm-AHUS.

Degree: 2009, , School of Computing

In this thesis work, the performance of uplink schedulers at the fixed WiMAX MAC layer has been considered. A new algorithm that adapts to… (more)

Subjects/Keywords: Adaptive; Heuristic; WiMAX; Uplink Scheduling; Performance Evaluation; Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Oyekanlu, E. A. (2009). Performance Evaluation of an Uplink Scheduling Algorithm in WiMAX Designing the Adaptive Heuristic Uplink Scheduling Algorithm-AHUS. (Thesis). , School of Computing. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3699

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):

Oyekanlu, Emmanuel Adebomi. “Performance Evaluation of an Uplink Scheduling Algorithm in WiMAX Designing the Adaptive Heuristic Uplink Scheduling Algorithm-AHUS.” 2009. Thesis, , School of Computing. Accessed September 20, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3699.

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

MLA Handbook (7th Edition):

Oyekanlu, Emmanuel Adebomi. “Performance Evaluation of an Uplink Scheduling Algorithm in WiMAX Designing the Adaptive Heuristic Uplink Scheduling Algorithm-AHUS.” 2009. Web. 20 Sep 2019.

Vancouver:

Oyekanlu EA. Performance Evaluation of an Uplink Scheduling Algorithm in WiMAX Designing the Adaptive Heuristic Uplink Scheduling Algorithm-AHUS. [Internet] [Thesis]. , School of Computing; 2009. [cited 2019 Sep 20]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3699.

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

Council of Science Editors:

Oyekanlu EA. Performance Evaluation of an Uplink Scheduling Algorithm in WiMAX Designing the Adaptive Heuristic Uplink Scheduling Algorithm-AHUS. [Thesis]. , School of Computing; 2009. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3699

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

13. Olsson, Jonas. Solving a highly constrained multi-level container loading problem from practice.

Degree: Faculty of Science & Engineering, 2017, Linköping UniversityLinköping University

  The container loading problem considered in this thesis is to determine placements of a set of packages within one or multiple shipping containers. Smaller… (more)

Subjects/Keywords: container loading; 3D packing; real-world application; heuristic; genetic algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Olsson, J. (2017). Solving a highly constrained multi-level container loading problem from practice. (Thesis). Linköping UniversityLinköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-134430

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):

Olsson, Jonas. “Solving a highly constrained multi-level container loading problem from practice.” 2017. Thesis, Linköping UniversityLinköping University. Accessed September 20, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-134430.

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

MLA Handbook (7th Edition):

Olsson, Jonas. “Solving a highly constrained multi-level container loading problem from practice.” 2017. Web. 20 Sep 2019.

Vancouver:

Olsson J. Solving a highly constrained multi-level container loading problem from practice. [Internet] [Thesis]. Linköping UniversityLinköping University; 2017. [cited 2019 Sep 20]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-134430.

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

Council of Science Editors:

Olsson J. Solving a highly constrained multi-level container loading problem from practice. [Thesis]. Linköping UniversityLinköping University; 2017. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-134430

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


George Mason University

14. Nies, Brandi. A Comparative Test of Traveling Salesman Solutions from GIS Software Packages .

Degree: 2015, George Mason University

 The Traveling Salesman Problem (TSP) has long been studied and remains a challenge in the realm of combinatorial optimization across many disciplines. This research investigates… (more)

Subjects/Keywords: network analysis; traveling salesman; route optimization; GIS; heuristic; exact algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nies, B. (2015). A Comparative Test of Traveling Salesman Solutions from GIS Software Packages . (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/9720

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):

Nies, Brandi. “A Comparative Test of Traveling Salesman Solutions from GIS Software Packages .” 2015. Thesis, George Mason University. Accessed September 20, 2019. http://hdl.handle.net/1920/9720.

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

MLA Handbook (7th Edition):

Nies, Brandi. “A Comparative Test of Traveling Salesman Solutions from GIS Software Packages .” 2015. Web. 20 Sep 2019.

Vancouver:

Nies B. A Comparative Test of Traveling Salesman Solutions from GIS Software Packages . [Internet] [Thesis]. George Mason University; 2015. [cited 2019 Sep 20]. Available from: http://hdl.handle.net/1920/9720.

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

Council of Science Editors:

Nies B. A Comparative Test of Traveling Salesman Solutions from GIS Software Packages . [Thesis]. George Mason University; 2015. Available from: http://hdl.handle.net/1920/9720

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

15. [No author]. PARALLEL ALGORITHMS FOR LARGE-SCALE GRAPH CLUSTERING ON DISTRIBUTED MEMORY ARCHITECTURES .

Degree: 2014, Washington State University

 Graph algorithms on parallel architectures present an interesting case study for irregular applications. We address one such irregular application  – one of clustering real world… (more)

Subjects/Keywords: Computer science; graph clustering; MapReduce algorithm; Shingling heuristic

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Sample image

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

author], [. (2014). PARALLEL ALGORITHMS FOR LARGE-SCALE GRAPH CLUSTERING ON DISTRIBUTED MEMORY ARCHITECTURES . (Thesis). Washington State University. Retrieved from http://hdl.handle.net/2376/5196

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):

author], [No. “PARALLEL ALGORITHMS FOR LARGE-SCALE GRAPH CLUSTERING ON DISTRIBUTED MEMORY ARCHITECTURES .” 2014. Thesis, Washington State University. Accessed September 20, 2019. http://hdl.handle.net/2376/5196.

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

MLA Handbook (7th Edition):

author], [No. “PARALLEL ALGORITHMS FOR LARGE-SCALE GRAPH CLUSTERING ON DISTRIBUTED MEMORY ARCHITECTURES .” 2014. Web. 20 Sep 2019.

Vancouver:

author] [. PARALLEL ALGORITHMS FOR LARGE-SCALE GRAPH CLUSTERING ON DISTRIBUTED MEMORY ARCHITECTURES . [Internet] [Thesis]. Washington State University; 2014. [cited 2019 Sep 20]. Available from: http://hdl.handle.net/2376/5196.

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

Council of Science Editors:

author] [. PARALLEL ALGORITHMS FOR LARGE-SCALE GRAPH CLUSTERING ON DISTRIBUTED MEMORY ARCHITECTURES . [Thesis]. Washington State University; 2014. Available from: http://hdl.handle.net/2376/5196

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


University of Wollongong

16. Sun, Geng. Teamwork as a service: design of a cloud-based system for enhancing teamwork performance in mobile learning.

Degree: Degree of Master of Information Systems and Technology by Research, 2013, University of Wollongong

  Since the technology of cloud computing has been widely adopted in many areas, it brings new ideas for promoting mobile learning. Practitioners and researchers… (more)

Subjects/Keywords: mobile learning; cloud computing; service orientated; heuristic algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sun, G. (2013). Teamwork as a service: design of a cloud-based system for enhancing teamwork performance in mobile learning. (Masters Thesis). University of Wollongong. Retrieved from 080505 Web Technologies (excl. Web Search), 080608 Information Systems Development Methodologies, 080612 Interorganisational Information Systems and Web Services ; https://ro.uow.edu.au/theses/3904

Chicago Manual of Style (16th Edition):

Sun, Geng. “Teamwork as a service: design of a cloud-based system for enhancing teamwork performance in mobile learning.” 2013. Masters Thesis, University of Wollongong. Accessed September 20, 2019. 080505 Web Technologies (excl. Web Search), 080608 Information Systems Development Methodologies, 080612 Interorganisational Information Systems and Web Services ; https://ro.uow.edu.au/theses/3904.

MLA Handbook (7th Edition):

Sun, Geng. “Teamwork as a service: design of a cloud-based system for enhancing teamwork performance in mobile learning.” 2013. Web. 20 Sep 2019.

Vancouver:

Sun G. Teamwork as a service: design of a cloud-based system for enhancing teamwork performance in mobile learning. [Internet] [Masters thesis]. University of Wollongong; 2013. [cited 2019 Sep 20]. Available from: 080505 Web Technologies (excl. Web Search), 080608 Information Systems Development Methodologies, 080612 Interorganisational Information Systems and Web Services ; https://ro.uow.edu.au/theses/3904.

Council of Science Editors:

Sun G. Teamwork as a service: design of a cloud-based system for enhancing teamwork performance in mobile learning. [Masters Thesis]. University of Wollongong; 2013. Available from: 080505 Web Technologies (excl. Web Search), 080608 Information Systems Development Methodologies, 080612 Interorganisational Information Systems and Web Services ; https://ro.uow.edu.au/theses/3904

17. Baskaran J. Heuristic search methods for optimal location of facts devices in a power system network;.

Degree: Heuristic search methods for optimal location of facts devices in a power system network, 2014, Anna University

Due to the deregulation of electric power supply to the consumers heavy line flows and unwanted loop flows occur It tend to incur greater losses… (more)

Subjects/Keywords: Electrical and electronics engineering; Genetic algorithm; Heuristic search; Memetic algorithm; Micro genetic algorithm; Power system; Power system network

Page 1

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

J, B. (2014). Heuristic search methods for optimal location of facts devices in a power system network;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/26590

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):

J, Baskaran. “Heuristic search methods for optimal location of facts devices in a power system network;.” 2014. Thesis, Anna University. Accessed September 20, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/26590.

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

MLA Handbook (7th Edition):

J, Baskaran. “Heuristic search methods for optimal location of facts devices in a power system network;.” 2014. Web. 20 Sep 2019.

Vancouver:

J B. Heuristic search methods for optimal location of facts devices in a power system network;. [Internet] [Thesis]. Anna University; 2014. [cited 2019 Sep 20]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/26590.

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

Council of Science Editors:

J B. Heuristic search methods for optimal location of facts devices in a power system network;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/26590

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


Brno University of Technology

18. Kluska, Martin. Získávání znalostí z procesních logů .

Degree: 2019, Brno University of Technology

 Tato práce popisuje metody získávání znalostí o procesu využitím algoritmů z oblasti process miningu. V práci jsou detailně popsané vybrané algoritmy, jejichž cílem je vytvoření… (more)

Subjects/Keywords: Process Mining; Process Discovery; Simulation; Alfa algoritmus; Heuristic minning; Process Mining; Process Discovery; Simulation; Alpha algorithm; Heuristic minning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kluska, M. (2019). Získávání znalostí z procesních logů . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/180430

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):

Kluska, Martin. “Získávání znalostí z procesních logů .” 2019. Thesis, Brno University of Technology. Accessed September 20, 2019. http://hdl.handle.net/11012/180430.

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

MLA Handbook (7th Edition):

Kluska, Martin. “Získávání znalostí z procesních logů .” 2019. Web. 20 Sep 2019.

Vancouver:

Kluska M. Získávání znalostí z procesních logů . [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2019 Sep 20]. Available from: http://hdl.handle.net/11012/180430.

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

Council of Science Editors:

Kluska M. Získávání znalostí z procesních logů . [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/180430

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


Universidade do Rio Grande do Sul

19. Silvestrin, Paulo Vitor. An efficient heuristic for the multi-compartment vehicle routing problem.

Degree: 2016, Universidade do Rio Grande do Sul

We study a variant of the vehicle routing problem that allows vehicles with multiple compartments. The need for multiple compartments frequently arises in practical applications… (more)

Subjects/Keywords: Heurística; Vehicle routing problem; Multi-compartment; Informatica : Transportes; Algorithm; Heuristic; Tabu search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Silvestrin, P. V. (2016). An efficient heuristic for the multi-compartment vehicle routing problem. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/149656

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):

Silvestrin, Paulo Vitor. “An efficient heuristic for the multi-compartment vehicle routing problem.” 2016. Thesis, Universidade do Rio Grande do Sul. Accessed September 20, 2019. http://hdl.handle.net/10183/149656.

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

MLA Handbook (7th Edition):

Silvestrin, Paulo Vitor. “An efficient heuristic for the multi-compartment vehicle routing problem.” 2016. Web. 20 Sep 2019.

Vancouver:

Silvestrin PV. An efficient heuristic for the multi-compartment vehicle routing problem. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2016. [cited 2019 Sep 20]. Available from: http://hdl.handle.net/10183/149656.

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

Council of Science Editors:

Silvestrin PV. An efficient heuristic for the multi-compartment vehicle routing problem. [Thesis]. Universidade do Rio Grande do Sul; 2016. Available from: http://hdl.handle.net/10183/149656

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


University of Georgia

20. Chen, Jianxia. Towards advanced event monitoring services on decentralized and delay tolerant networks.

Degree: PhD, Computer Science, 2011, University of Georgia

 Event monitoring services are rapidly gaining importance in many application domains ranging from real time monitoring systems in production, logistics and networking to complex event… (more)

Subjects/Keywords: Event Monitoring; Event Aggregation; Redundancy Elimination; Complex Event Detection; Delay Tolerant Network; Heuristic Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, J. (2011). Towards advanced event monitoring services on decentralized and delay tolerant networks. (Doctoral Dissertation). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/chen_jianxia_201108_phd

Chicago Manual of Style (16th Edition):

Chen, Jianxia. “Towards advanced event monitoring services on decentralized and delay tolerant networks.” 2011. Doctoral Dissertation, University of Georgia. Accessed September 20, 2019. http://purl.galileo.usg.edu/uga_etd/chen_jianxia_201108_phd.

MLA Handbook (7th Edition):

Chen, Jianxia. “Towards advanced event monitoring services on decentralized and delay tolerant networks.” 2011. Web. 20 Sep 2019.

Vancouver:

Chen J. Towards advanced event monitoring services on decentralized and delay tolerant networks. [Internet] [Doctoral dissertation]. University of Georgia; 2011. [cited 2019 Sep 20]. Available from: http://purl.galileo.usg.edu/uga_etd/chen_jianxia_201108_phd.

Council of Science Editors:

Chen J. Towards advanced event monitoring services on decentralized and delay tolerant networks. [Doctoral Dissertation]. University of Georgia; 2011. Available from: http://purl.galileo.usg.edu/uga_etd/chen_jianxia_201108_phd

21. Lundquist, Josefin. An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB.

Degree: Mathematics and Mathematical Statistics, 2017, Umeå University

  A key challenge for manufacturing companies is to store parts in an efficient way atthe lowest cost possible. As the demand of differentiated products… (more)

Subjects/Keywords: Inventory optimization; Integer programming; Generalized assignment problem; Combinatorial optimization; Greedy heuristic; Constructive algorithm; Mathematics; Matematik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lundquist, J. (2017). An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB. (Thesis). Umeå University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-137825

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):

Lundquist, Josefin. “An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB.” 2017. Thesis, Umeå University. Accessed September 20, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-137825.

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

MLA Handbook (7th Edition):

Lundquist, Josefin. “An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB.” 2017. Web. 20 Sep 2019.

Vancouver:

Lundquist J. An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB. [Internet] [Thesis]. Umeå University; 2017. [cited 2019 Sep 20]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-137825.

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

Council of Science Editors:

Lundquist J. An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB. [Thesis]. Umeå University; 2017. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-137825

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


Universidade do Rio Grande do Norte

22. Pereira, Elder Gonçalves. O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico .

Degree: 2014, Universidade do Rio Grande do Norte

 The Hiker Dice was a game recently proposed in a software designed by Mara Kuzmich and Leonardo Goldbarg. In the game a dice is responsible… (more)

Subjects/Keywords: Hiker Dice. Algoritmo Exato. Algoritmos Heurísticos; Hiker Dice. Exact Algorithm. Heuristic Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pereira, E. G. (2014). O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico . (Masters Thesis). Universidade do Rio Grande do Norte. Retrieved from http://repositorio.ufrn.br/handle/123456789/18104

Chicago Manual of Style (16th Edition):

Pereira, Elder Gonçalves. “O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico .” 2014. Masters Thesis, Universidade do Rio Grande do Norte. Accessed September 20, 2019. http://repositorio.ufrn.br/handle/123456789/18104.

MLA Handbook (7th Edition):

Pereira, Elder Gonçalves. “O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico .” 2014. Web. 20 Sep 2019.

Vancouver:

Pereira EG. O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico . [Internet] [Masters thesis]. Universidade do Rio Grande do Norte; 2014. [cited 2019 Sep 20]. Available from: http://repositorio.ufrn.br/handle/123456789/18104.

Council of Science Editors:

Pereira EG. O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico . [Masters Thesis]. Universidade do Rio Grande do Norte; 2014. Available from: http://repositorio.ufrn.br/handle/123456789/18104

23. Ahmad, Qazi Shoeb. Heuristic procedures for solving some integer and sequencing problems;.

Degree: Statistics and Operations Research, 2000, Aligarh Muslim University

Abstract not available newline newline

Bibliography p. i-ix

Advisors/Committee Members: Bari, Abdul.

Subjects/Keywords: Heuristic; Integer; Sequencing; Linear Programming; Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ahmad, Q. S. (2000). Heuristic procedures for solving some integer and sequencing problems;. (Thesis). Aligarh Muslim University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/50016

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):

Ahmad, Qazi Shoeb. “Heuristic procedures for solving some integer and sequencing problems;.” 2000. Thesis, Aligarh Muslim University. Accessed September 20, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/50016.

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

MLA Handbook (7th Edition):

Ahmad, Qazi Shoeb. “Heuristic procedures for solving some integer and sequencing problems;.” 2000. Web. 20 Sep 2019.

Vancouver:

Ahmad QS. Heuristic procedures for solving some integer and sequencing problems;. [Internet] [Thesis]. Aligarh Muslim University; 2000. [cited 2019 Sep 20]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/50016.

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

Council of Science Editors:

Ahmad QS. Heuristic procedures for solving some integer and sequencing problems;. [Thesis]. Aligarh Muslim University; 2000. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/50016

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


Vilnius University

24. Liogys, Mindaugas. Heuristic Algorithms for Nurse Rostering Problem.

Degree: PhD, Informatics Engineering, 2013, Vilnius University

In the dissertation the nurse rostering problem is investigated. The formulation of the problem is based on real-world data of one of the largest healthcare… (more)

Subjects/Keywords: Nurse rostering problem; Heuristic algorithm; Multi-objective problem; Darbų grafikų optimizavimas; Euristiniai algoritmai; Daugiakriteris uždavinys

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liogys, Mindaugas. (2013). Heuristic Algorithms for Nurse Rostering Problem. (Doctoral Dissertation). Vilnius University. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20130930_092436-21259 ;

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

Liogys, Mindaugas. “Heuristic Algorithms for Nurse Rostering Problem.” 2013. Doctoral Dissertation, Vilnius University. Accessed September 20, 2019. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20130930_092436-21259 ;.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

Liogys, Mindaugas. “Heuristic Algorithms for Nurse Rostering Problem.” 2013. Web. 20 Sep 2019.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

Liogys, Mindaugas. Heuristic Algorithms for Nurse Rostering Problem. [Internet] [Doctoral dissertation]. Vilnius University; 2013. [cited 2019 Sep 20]. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20130930_092436-21259 ;.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

Liogys, Mindaugas. Heuristic Algorithms for Nurse Rostering Problem. [Doctoral Dissertation]. Vilnius University; 2013. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20130930_092436-21259 ;

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete


NSYSU

25. Peng, Yuan-ching. Design of Multi-population Genetic Algorithms under Different Hierarchical Architectures.

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

 Metaheuristics have recently been commonly used to solve complex problems in real applications. They are easy to use and usually get good solutions for the… (more)

Subjects/Keywords: migration strategy; multiple sub-populations; Genetic algorithm; hierarchical execution structure; meta-heuristic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Peng, Y. (2016). Design of Multi-population Genetic Algorithms under Different Hierarchical Architectures. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0718116-154924

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):

Peng, Yuan-ching. “Design of Multi-population Genetic Algorithms under Different Hierarchical Architectures.” 2016. Thesis, NSYSU. Accessed September 20, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0718116-154924.

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

MLA Handbook (7th Edition):

Peng, Yuan-ching. “Design of Multi-population Genetic Algorithms under Different Hierarchical Architectures.” 2016. Web. 20 Sep 2019.

Vancouver:

Peng Y. Design of Multi-population Genetic Algorithms under Different Hierarchical Architectures. [Internet] [Thesis]. NSYSU; 2016. [cited 2019 Sep 20]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0718116-154924.

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

Council of Science Editors:

Peng Y. Design of Multi-population Genetic Algorithms under Different Hierarchical Architectures. [Thesis]. NSYSU; 2016. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0718116-154924

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


NSYSU

26. Chan, Huang-Ting. The Definitions and Computation of the Two Dimensional Largest Common Substructure Problems.

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

 The traditional longest common subsequence (LCS) problem is to find the maximum number of ordered matches in two sequences. The similarity of two one-dimensional sequences… (more)

Subjects/Keywords: Longest Common Subsequence; Similarity; NP-hard; Matrices; Integer Linear Programming; Heuristic Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chan, H. (2016). The Definitions and Computation of the Two Dimensional Largest Common Substructure Problems. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0031116-004017

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):

Chan, Huang-Ting. “The Definitions and Computation of the Two Dimensional Largest Common Substructure Problems.” 2016. Thesis, NSYSU. Accessed September 20, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0031116-004017.

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

MLA Handbook (7th Edition):

Chan, Huang-Ting. “The Definitions and Computation of the Two Dimensional Largest Common Substructure Problems.” 2016. Web. 20 Sep 2019.

Vancouver:

Chan H. The Definitions and Computation of the Two Dimensional Largest Common Substructure Problems. [Internet] [Thesis]. NSYSU; 2016. [cited 2019 Sep 20]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0031116-004017.

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

Council of Science Editors:

Chan H. The Definitions and Computation of the Two Dimensional Largest Common Substructure Problems. [Thesis]. NSYSU; 2016. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0031116-004017

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


Universidade do Rio Grande do Norte

27. Pereira, Elder Gonçalves. O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico .

Degree: 2014, Universidade do Rio Grande do Norte

 The Hiker Dice was a game recently proposed in a software designed by Mara Kuzmich and Leonardo Goldbarg. In the game a dice is responsible… (more)

Subjects/Keywords: Hiker Dice. Algoritmo Exato. Algoritmos Heurísticos; Hiker Dice. Exact Algorithm. Heuristic Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pereira, E. G. (2014). O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico . (Thesis). Universidade do Rio Grande do Norte. Retrieved from http://repositorio.ufrn.br/handle/123456789/18104

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):

Pereira, Elder Gonçalves. “O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico .” 2014. Thesis, Universidade do Rio Grande do Norte. Accessed September 20, 2019. http://repositorio.ufrn.br/handle/123456789/18104.

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

MLA Handbook (7th Edition):

Pereira, Elder Gonçalves. “O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico .” 2014. Web. 20 Sep 2019.

Vancouver:

Pereira EG. O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico . [Internet] [Thesis]. Universidade do Rio Grande do Norte; 2014. [cited 2019 Sep 20]. Available from: http://repositorio.ufrn.br/handle/123456789/18104.

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

Council of Science Editors:

Pereira EG. O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico . [Thesis]. Universidade do Rio Grande do Norte; 2014. Available from: http://repositorio.ufrn.br/handle/123456789/18104

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


University of Louisville

28. Xu, Guangyang. Optimal scheduling for charging electric vehicles with fixed setup costs.

Degree: MS, 2013, University of Louisville

  The increasing popularity of electric vehicles (EV) will pose great challenge to the nation's existing power grid by adding extra load during evening peak… (more)

Subjects/Keywords: Electric vehicles; Demand side management; Coordinated charging; Mixed integer program; Heuristic algorithm; Optimal scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xu, G. (2013). Optimal scheduling for charging electric vehicles with fixed setup costs. (Masters Thesis). University of Louisville. Retrieved from 10.18297/etd/1607 ; https://ir.library.louisville.edu/etd/1607

Chicago Manual of Style (16th Edition):

Xu, Guangyang. “Optimal scheduling for charging electric vehicles with fixed setup costs.” 2013. Masters Thesis, University of Louisville. Accessed September 20, 2019. 10.18297/etd/1607 ; https://ir.library.louisville.edu/etd/1607.

MLA Handbook (7th Edition):

Xu, Guangyang. “Optimal scheduling for charging electric vehicles with fixed setup costs.” 2013. Web. 20 Sep 2019.

Vancouver:

Xu G. Optimal scheduling for charging electric vehicles with fixed setup costs. [Internet] [Masters thesis]. University of Louisville; 2013. [cited 2019 Sep 20]. Available from: 10.18297/etd/1607 ; https://ir.library.louisville.edu/etd/1607.

Council of Science Editors:

Xu G. Optimal scheduling for charging electric vehicles with fixed setup costs. [Masters Thesis]. University of Louisville; 2013. Available from: 10.18297/etd/1607 ; https://ir.library.louisville.edu/etd/1607

29. Ma, Jiya. A Genetic Algorithm for Solar Boat.

Degree: Computer Engineering, 2008, Dalarna University

  Genetic algorithm has been widely used in different areas of optimization problems. Ithas been combined with renewable energy domain, photovoltaic system, in this thesis.To… (more)

Subjects/Keywords: Photovoltaic System; Standalone System with Back up; Heuristic function; Genetic Algorithm optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ma, J. (2008). A Genetic Algorithm for Solar Boat. (Thesis). Dalarna University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:du-3488

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):

Ma, Jiya. “A Genetic Algorithm for Solar Boat.” 2008. Thesis, Dalarna University. Accessed September 20, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:du-3488.

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

MLA Handbook (7th Edition):

Ma, Jiya. “A Genetic Algorithm for Solar Boat.” 2008. Web. 20 Sep 2019.

Vancouver:

Ma J. A Genetic Algorithm for Solar Boat. [Internet] [Thesis]. Dalarna University; 2008. [cited 2019 Sep 20]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-3488.

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

Council of Science Editors:

Ma J. A Genetic Algorithm for Solar Boat. [Thesis]. Dalarna University; 2008. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-3488

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

30. Lianjie, Shen. Optimization and Search in Model-Based Automotive SW/HW Development.

Degree: The Institute of Technology, 2014, Linköping UniversityLinköping University

  In this thesis two case studies are performed about solving two design problems we face during the design phase of new Volvo truck. One… (more)

Subjects/Keywords: genetic algorithm; optimization; search heuristic

…Chapter 1 Introduction 2 algorithm chapter, we describe in detail the algorithm we use… …problems are solved with help of the genetic algorithm, with the detailed parameter settings we… …analysis of the information we have before we start the genetic algorithm, to try to increase the… …the genetic algorithm gets. The optimization engine is the genetic algorithm process defined… …intelligence based method provide a better solution? 13 Chapter 4 Genetic Algorithm Genetic… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lianjie, S. (2014). Optimization and Search in Model-Based Automotive SW/HW Development. (Thesis). Linköping UniversityLinköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-105394

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):

Lianjie, Shen. “Optimization and Search in Model-Based Automotive SW/HW Development.” 2014. Thesis, Linköping UniversityLinköping University. Accessed September 20, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-105394.

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

MLA Handbook (7th Edition):

Lianjie, Shen. “Optimization and Search in Model-Based Automotive SW/HW Development.” 2014. Web. 20 Sep 2019.

Vancouver:

Lianjie S. Optimization and Search in Model-Based Automotive SW/HW Development. [Internet] [Thesis]. Linköping UniversityLinköping University; 2014. [cited 2019 Sep 20]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-105394.

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

Council of Science Editors:

Lianjie S. Optimization and Search in Model-Based Automotive SW/HW Development. [Thesis]. Linköping UniversityLinköping University; 2014. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-105394

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

[1] [2] [3] [4]

.