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:(local search). Showing records 1 – 30 of 195 total matches.

[1] [2] [3] [4] [5] [6] [7]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Universidade Nova

1. Saleh, Amr Hany. Constraint reasoning with local search for continuous optimization.

Degree: 2014, Universidade Nova

 Optimization is a very important field for getting the best possible value for the optimization function. Continuous optimization is optimization over real intervals. There are… (more)

Subjects/Keywords: Optimization; Constraint satisfaction; Local search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Saleh, A. H. (2014). Constraint reasoning with local search for continuous optimization. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/13253

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

Saleh, Amr Hany. “Constraint reasoning with local search for continuous optimization.” 2014. Thesis, Universidade Nova. Accessed November 28, 2020. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/13253.

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

MLA Handbook (7th Edition):

Saleh, Amr Hany. “Constraint reasoning with local search for continuous optimization.” 2014. Web. 28 Nov 2020.

Vancouver:

Saleh AH. Constraint reasoning with local search for continuous optimization. [Internet] [Thesis]. Universidade Nova; 2014. [cited 2020 Nov 28]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/13253.

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

Council of Science Editors:

Saleh AH. Constraint reasoning with local search for continuous optimization. [Thesis]. Universidade Nova; 2014. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/13253

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


Colorado State University

2. Hains, Doug. Structure in combinatorial optimization and its effect on heuristic performance.

Degree: PhD, Computer Science, 2013, Colorado State University

 The goal in combinatorial optimization is to find a good solution among a finite set of solutions. In many combinatorial problems, the set of solutions… (more)

Subjects/Keywords: combinatorial optimization; satisfiability; local search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hains, D. (2013). Structure in combinatorial optimization and its effect on heuristic performance. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/80944

Chicago Manual of Style (16th Edition):

Hains, Doug. “Structure in combinatorial optimization and its effect on heuristic performance.” 2013. Doctoral Dissertation, Colorado State University. Accessed November 28, 2020. http://hdl.handle.net/10217/80944.

MLA Handbook (7th Edition):

Hains, Doug. “Structure in combinatorial optimization and its effect on heuristic performance.” 2013. Web. 28 Nov 2020.

Vancouver:

Hains D. Structure in combinatorial optimization and its effect on heuristic performance. [Internet] [Doctoral dissertation]. Colorado State University; 2013. [cited 2020 Nov 28]. Available from: http://hdl.handle.net/10217/80944.

Council of Science Editors:

Hains D. Structure in combinatorial optimization and its effect on heuristic performance. [Doctoral Dissertation]. Colorado State University; 2013. Available from: http://hdl.handle.net/10217/80944


Colorado State University

3. Chen, Wenxiang. Discovering and harnessing structures in solving application satisfiability instances.

Degree: PhD, Computer Science, 2018, Colorado State University

 Boolean satisfiability (SAT) is the first problem proven to be NP-Complete. It has become a fundamental problem for computational complexity theory, and many real-world problems… (more)

Subjects/Keywords: MAXSAT; SAT; optimization; local search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, W. (2018). Discovering and harnessing structures in solving application satisfiability instances. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/189292

Chicago Manual of Style (16th Edition):

Chen, Wenxiang. “Discovering and harnessing structures in solving application satisfiability instances.” 2018. Doctoral Dissertation, Colorado State University. Accessed November 28, 2020. http://hdl.handle.net/10217/189292.

MLA Handbook (7th Edition):

Chen, Wenxiang. “Discovering and harnessing structures in solving application satisfiability instances.” 2018. Web. 28 Nov 2020.

Vancouver:

Chen W. Discovering and harnessing structures in solving application satisfiability instances. [Internet] [Doctoral dissertation]. Colorado State University; 2018. [cited 2020 Nov 28]. Available from: http://hdl.handle.net/10217/189292.

Council of Science Editors:

Chen W. Discovering and harnessing structures in solving application satisfiability instances. [Doctoral Dissertation]. Colorado State University; 2018. Available from: http://hdl.handle.net/10217/189292


Colorado State University

4. Sutton, Andrew M. Analysis of combinatorial search spaces for a class of NP-hard problems, An.

Degree: PhD, Computer Science, 2011, Colorado State University

 Given a finite but very large set of states X and a real-valued objective function ƒ defined on X, combinatorial optimization refers to the problem… (more)

Subjects/Keywords: combinatorial optimization; combinatorial search; local search; pseudo-Boolean functions; search space analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sutton, A. M. (2011). Analysis of combinatorial search spaces for a class of NP-hard problems, An. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/50161

Chicago Manual of Style (16th Edition):

Sutton, Andrew M. “Analysis of combinatorial search spaces for a class of NP-hard problems, An.” 2011. Doctoral Dissertation, Colorado State University. Accessed November 28, 2020. http://hdl.handle.net/10217/50161.

MLA Handbook (7th Edition):

Sutton, Andrew M. “Analysis of combinatorial search spaces for a class of NP-hard problems, An.” 2011. Web. 28 Nov 2020.

Vancouver:

Sutton AM. Analysis of combinatorial search spaces for a class of NP-hard problems, An. [Internet] [Doctoral dissertation]. Colorado State University; 2011. [cited 2020 Nov 28]. Available from: http://hdl.handle.net/10217/50161.

Council of Science Editors:

Sutton AM. Analysis of combinatorial search spaces for a class of NP-hard problems, An. [Doctoral Dissertation]. Colorado State University; 2011. Available from: http://hdl.handle.net/10217/50161


Virginia Tech

5. Henry, Andrew Joseph. Integrated Process Planning and Scheduling for a Complex Job Shop Using a Proxy Based Local Search.

Degree: PhD, Industrial and Systems Engineering, 2015, Virginia Tech

 Within manufacturing systems, process planning and scheduling are two interrelated problems that are often treated independently. Process planning involves deciding which operations are required to… (more)

Subjects/Keywords: scheduling; process planning; local search; job shop

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Henry, A. J. (2015). Integrated Process Planning and Scheduling for a Complex Job Shop Using a Proxy Based Local Search. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/77885

Chicago Manual of Style (16th Edition):

Henry, Andrew Joseph. “Integrated Process Planning and Scheduling for a Complex Job Shop Using a Proxy Based Local Search.” 2015. Doctoral Dissertation, Virginia Tech. Accessed November 28, 2020. http://hdl.handle.net/10919/77885.

MLA Handbook (7th Edition):

Henry, Andrew Joseph. “Integrated Process Planning and Scheduling for a Complex Job Shop Using a Proxy Based Local Search.” 2015. Web. 28 Nov 2020.

Vancouver:

Henry AJ. Integrated Process Planning and Scheduling for a Complex Job Shop Using a Proxy Based Local Search. [Internet] [Doctoral dissertation]. Virginia Tech; 2015. [cited 2020 Nov 28]. Available from: http://hdl.handle.net/10919/77885.

Council of Science Editors:

Henry AJ. Integrated Process Planning and Scheduling for a Complex Job Shop Using a Proxy Based Local Search. [Doctoral Dissertation]. Virginia Tech; 2015. Available from: http://hdl.handle.net/10919/77885


Delft University of Technology

6. Villa Acuña, Paloma (author). An enhanced Genetic Algorithm and its application on two non-linear geophysical problems.

Degree: 2018, Delft University of Technology

 Since its inception in 1975, Genetics Algorithms (GAs) have been successfully used as a tool for global optimization on non-convex problems in a wide range… (more)

Subjects/Keywords: Genetic Algorithms; Global search; Local search; Convergence speed

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Villa Acuña, P. (. (2018). An enhanced Genetic Algorithm and its application on two non-linear geophysical problems. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:cf4bf7ed-222f-4248-aa0e-f8d085125e4d

Chicago Manual of Style (16th Edition):

Villa Acuña, Paloma (author). “An enhanced Genetic Algorithm and its application on two non-linear geophysical problems.” 2018. Masters Thesis, Delft University of Technology. Accessed November 28, 2020. http://resolver.tudelft.nl/uuid:cf4bf7ed-222f-4248-aa0e-f8d085125e4d.

MLA Handbook (7th Edition):

Villa Acuña, Paloma (author). “An enhanced Genetic Algorithm and its application on two non-linear geophysical problems.” 2018. Web. 28 Nov 2020.

Vancouver:

Villa Acuña P(. An enhanced Genetic Algorithm and its application on two non-linear geophysical problems. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2020 Nov 28]. Available from: http://resolver.tudelft.nl/uuid:cf4bf7ed-222f-4248-aa0e-f8d085125e4d.

Council of Science Editors:

Villa Acuña P(. An enhanced Genetic Algorithm and its application on two non-linear geophysical problems. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:cf4bf7ed-222f-4248-aa0e-f8d085125e4d


Colorado State University

7. Hains, Douglas R. Generalized partition crossover for the traveling salesman problem.

Degree: MS(M.S.), Computer Science, 2011, Colorado State University

 The Traveling Salesman Problem (TSP) is a well-studied combinatorial optimization problem with a wide spectrum of applications and theoretical value. We have designed a new… (more)

Subjects/Keywords: genetic algorithms; Traveling Salesman Problem; search space; local search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hains, D. R. (2011). Generalized partition crossover for the traveling salesman problem. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/47314

Chicago Manual of Style (16th Edition):

Hains, Douglas R. “Generalized partition crossover for the traveling salesman problem.” 2011. Masters Thesis, Colorado State University. Accessed November 28, 2020. http://hdl.handle.net/10217/47314.

MLA Handbook (7th Edition):

Hains, Douglas R. “Generalized partition crossover for the traveling salesman problem.” 2011. Web. 28 Nov 2020.

Vancouver:

Hains DR. Generalized partition crossover for the traveling salesman problem. [Internet] [Masters thesis]. Colorado State University; 2011. [cited 2020 Nov 28]. Available from: http://hdl.handle.net/10217/47314.

Council of Science Editors:

Hains DR. Generalized partition crossover for the traveling salesman problem. [Masters Thesis]. Colorado State University; 2011. Available from: http://hdl.handle.net/10217/47314


Brunel University

8. Derrick, Deborah Chippington. Models, methods and algorithms for supply chain planning.

Degree: PhD, 2011, Brunel University

 An outline of supply chains and differences in the problem types is given. The motivation for a generic framework is discussed and explored. A conceptual… (more)

Subjects/Keywords: 658.05; General supply chain; Scenario modelling; Neighbourhood search; Local search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Derrick, D. C. (2011). Models, methods and algorithms for supply chain planning. (Doctoral Dissertation). Brunel University. Retrieved from http://bura.brunel.ac.uk/handle/2438/6024 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.542866

Chicago Manual of Style (16th Edition):

Derrick, Deborah Chippington. “Models, methods and algorithms for supply chain planning.” 2011. Doctoral Dissertation, Brunel University. Accessed November 28, 2020. http://bura.brunel.ac.uk/handle/2438/6024 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.542866.

MLA Handbook (7th Edition):

Derrick, Deborah Chippington. “Models, methods and algorithms for supply chain planning.” 2011. Web. 28 Nov 2020.

Vancouver:

Derrick DC. Models, methods and algorithms for supply chain planning. [Internet] [Doctoral dissertation]. Brunel University; 2011. [cited 2020 Nov 28]. Available from: http://bura.brunel.ac.uk/handle/2438/6024 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.542866.

Council of Science Editors:

Derrick DC. Models, methods and algorithms for supply chain planning. [Doctoral Dissertation]. Brunel University; 2011. Available from: http://bura.brunel.ac.uk/handle/2438/6024 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.542866


Anna University

9. Manavalasundaram V K. Efficient scheduling in decentralized grid environment;.

Degree: Efficient scheduling in decentralized grid environment, 2014, Anna University

The grid computing enables wide area resource sharing and collaboration It is a fast emerging distributed technology Based on scheduling of computational jobs for different… (more)

Subjects/Keywords: Grid computing; Heuristic Local Search; Heuristic Simulated Annealing; Heuristic Tabu Search; Information and communication engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

K, M. V. (2014). Efficient scheduling in decentralized grid environment;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/22911

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

K, Manavalasundaram V. “Efficient scheduling in decentralized grid environment;.” 2014. Thesis, Anna University. Accessed November 28, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/22911.

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

MLA Handbook (7th Edition):

K, Manavalasundaram V. “Efficient scheduling in decentralized grid environment;.” 2014. Web. 28 Nov 2020.

Vancouver:

K MV. Efficient scheduling in decentralized grid environment;. [Internet] [Thesis]. Anna University; 2014. [cited 2020 Nov 28]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/22911.

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

Council of Science Editors:

K MV. Efficient scheduling in decentralized grid environment;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/22911

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


Georgia Tech

10. Dong, Xinjun. Finite element model updating through smooth nonconvex optimization.

Degree: PhD, Civil and Environmental Engineering, 2019, Georgia Tech

 During the past few decades, great efforts have been devoted towards finite element (FE) modeling of structures, in order to simulate the structural behavior under… (more)

Subjects/Keywords: Finite element model updating; Frequency-domain formulations; Local search optimization algorithm; Global search optimization algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dong, X. (2019). Finite element model updating through smooth nonconvex optimization. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/62625

Chicago Manual of Style (16th Edition):

Dong, Xinjun. “Finite element model updating through smooth nonconvex optimization.” 2019. Doctoral Dissertation, Georgia Tech. Accessed November 28, 2020. http://hdl.handle.net/1853/62625.

MLA Handbook (7th Edition):

Dong, Xinjun. “Finite element model updating through smooth nonconvex optimization.” 2019. Web. 28 Nov 2020.

Vancouver:

Dong X. Finite element model updating through smooth nonconvex optimization. [Internet] [Doctoral dissertation]. Georgia Tech; 2019. [cited 2020 Nov 28]. Available from: http://hdl.handle.net/1853/62625.

Council of Science Editors:

Dong X. Finite element model updating through smooth nonconvex optimization. [Doctoral Dissertation]. Georgia Tech; 2019. Available from: http://hdl.handle.net/1853/62625

11. Machado, Rui Mário da Silva. Massivel y parallel declarative computational models.

Degree: 2013, Universidade de Évora

 Current computer archictectures are parallel, with an increasing number of processors. Parallel programming is an error-prone task and declarative models such as those based on… (more)

Subjects/Keywords: UTS; GPI; Constraint programming; Local search; Adaptive search; Parallel programming; Work stealing; Dynamic load balancing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Machado, R. M. d. S. (2013). Massivel y parallel declarative computational models. (Thesis). Universidade de Évora. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:dspace.uevora.pt:10174/12063

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

Machado, Rui Mário da Silva. “Massivel y parallel declarative computational models.” 2013. Thesis, Universidade de Évora. Accessed November 28, 2020. http://www.rcaap.pt/detail.jsp?id=oai:dspace.uevora.pt:10174/12063.

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

MLA Handbook (7th Edition):

Machado, Rui Mário da Silva. “Massivel y parallel declarative computational models.” 2013. Web. 28 Nov 2020.

Vancouver:

Machado RMdS. Massivel y parallel declarative computational models. [Internet] [Thesis]. Universidade de Évora; 2013. [cited 2020 Nov 28]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:dspace.uevora.pt:10174/12063.

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

Council of Science Editors:

Machado RMdS. Massivel y parallel declarative computational models. [Thesis]. Universidade de Évora; 2013. Available from: http://www.rcaap.pt/detail.jsp?id=oai:dspace.uevora.pt:10174/12063

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


Delft University of Technology

12. van Lochem, Jelmer (author). Improving Dynamic Route Optimisation by making use of Historical Data.

Degree: 2019, Delft University of Technology

In thedynamic world we live in, the transportation of people and goods in a reliable,efficient and timely manner has grown to be more important than… (more)

Subjects/Keywords: vehicle routing; dvrp; stochastic vehicle routing; large neighbourhood search; heuristics; local search; ruin & recreate

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

van Lochem, J. (. (2019). Improving Dynamic Route Optimisation by making use of Historical Data. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:554bf03a-b57e-4932-962b-defb4af2e50b

Chicago Manual of Style (16th Edition):

van Lochem, Jelmer (author). “Improving Dynamic Route Optimisation by making use of Historical Data.” 2019. Masters Thesis, Delft University of Technology. Accessed November 28, 2020. http://resolver.tudelft.nl/uuid:554bf03a-b57e-4932-962b-defb4af2e50b.

MLA Handbook (7th Edition):

van Lochem, Jelmer (author). “Improving Dynamic Route Optimisation by making use of Historical Data.” 2019. Web. 28 Nov 2020.

Vancouver:

van Lochem J(. Improving Dynamic Route Optimisation by making use of Historical Data. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2020 Nov 28]. Available from: http://resolver.tudelft.nl/uuid:554bf03a-b57e-4932-962b-defb4af2e50b.

Council of Science Editors:

van Lochem J(. Improving Dynamic Route Optimisation by making use of Historical Data. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:554bf03a-b57e-4932-962b-defb4af2e50b


Robert Gordon University

13. Magaji, Amina Sambo-Muhammad. Combining search strategies for distributed constraint satisfaction.

Degree: PhD, 2015, Robert Gordon University

 Many real-life problems such as distributed meeting scheduling, mobile frequency allocation and resource allocation can be solved using multi-agent paradigms. Distributed constraint satisfaction problems (DisCSPs)… (more)

Subjects/Keywords: 005.1; Distributed constraint satisfaction; Distributed problem solving; Local search; Algorithms; Local optima; Heuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Magaji, A. S. (2015). Combining search strategies for distributed constraint satisfaction. (Doctoral Dissertation). Robert Gordon University. Retrieved from http://hdl.handle.net/10059/1374

Chicago Manual of Style (16th Edition):

Magaji, Amina Sambo-Muhammad. “Combining search strategies for distributed constraint satisfaction.” 2015. Doctoral Dissertation, Robert Gordon University. Accessed November 28, 2020. http://hdl.handle.net/10059/1374.

MLA Handbook (7th Edition):

Magaji, Amina Sambo-Muhammad. “Combining search strategies for distributed constraint satisfaction.” 2015. Web. 28 Nov 2020.

Vancouver:

Magaji AS. Combining search strategies for distributed constraint satisfaction. [Internet] [Doctoral dissertation]. Robert Gordon University; 2015. [cited 2020 Nov 28]. Available from: http://hdl.handle.net/10059/1374.

Council of Science Editors:

Magaji AS. Combining search strategies for distributed constraint satisfaction. [Doctoral Dissertation]. Robert Gordon University; 2015. Available from: http://hdl.handle.net/10059/1374


George Mason University

14. Olson, Brian. Local Minima Hopping along the Protein Energy Surface .

Degree: 2012, George Mason University

 Modeling of protein molecules in silico for the purpose of elucidating the three-dimensional structure where the protein is biologically active employs the knowledge that the… (more)

Subjects/Keywords: Native Structure; Near-Native Conformations; Local Minimum; Iterated Local Search; Fragment-Based Assembly

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Olson, B. (2012). Local Minima Hopping along the Protein Energy Surface . (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/7479

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

Olson, Brian. “Local Minima Hopping along the Protein Energy Surface .” 2012. Thesis, George Mason University. Accessed November 28, 2020. http://hdl.handle.net/1920/7479.

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

MLA Handbook (7th Edition):

Olson, Brian. “Local Minima Hopping along the Protein Energy Surface .” 2012. Web. 28 Nov 2020.

Vancouver:

Olson B. Local Minima Hopping along the Protein Energy Surface . [Internet] [Thesis]. George Mason University; 2012. [cited 2020 Nov 28]. Available from: http://hdl.handle.net/1920/7479.

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

Council of Science Editors:

Olson B. Local Minima Hopping along the Protein Energy Surface . [Thesis]. George Mason University; 2012. Available from: http://hdl.handle.net/1920/7479

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


NSYSU

15. Wang, Chih-Ming. Collaborative Content Sharing and Matching Service on Cloud-based e-Learning Platform.

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

 With the development of Web 2.0, the Internet users can be led to creating, collaborating, and sharing all kinds of information and content. Rich and… (more)

Subjects/Keywords: sharing; Collaborative content; local search; cloud computing; matching

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, C. (2013). Collaborative Content Sharing and Matching Service on Cloud-based e-Learning Platform. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0205113-140901

Chicago Manual of Style (16th Edition):

Wang, Chih-Ming. “Collaborative Content Sharing and Matching Service on Cloud-based e-Learning Platform.” 2013. Doctoral Dissertation, NSYSU. Accessed November 28, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0205113-140901.

MLA Handbook (7th Edition):

Wang, Chih-Ming. “Collaborative Content Sharing and Matching Service on Cloud-based e-Learning Platform.” 2013. Web. 28 Nov 2020.

Vancouver:

Wang C. Collaborative Content Sharing and Matching Service on Cloud-based e-Learning Platform. [Internet] [Doctoral dissertation]. NSYSU; 2013. [cited 2020 Nov 28]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0205113-140901.

Council of Science Editors:

Wang C. Collaborative Content Sharing and Matching Service on Cloud-based e-Learning Platform. [Doctoral Dissertation]. NSYSU; 2013. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0205113-140901


Universiteit Utrecht

16. Blokland, C.H.M. van. Solution approaches for solving stochastic job shop and blocking job shop problems.

Degree: 2012, Universiteit Utrecht

 The Stochastic and Blocking Job Shop Scheduling problems are two extensions of the Standard Job Scheduling Problem. In the stochastic extension, processing times retrieve a… (more)

Subjects/Keywords: local search; discrete-event simulation; MIP; job-shop scheduling; uncertainties

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Blokland, C. H. M. v. (2012). Solution approaches for solving stochastic job shop and blocking job shop problems. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/256138

Chicago Manual of Style (16th Edition):

Blokland, C H M van. “Solution approaches for solving stochastic job shop and blocking job shop problems.” 2012. Masters Thesis, Universiteit Utrecht. Accessed November 28, 2020. http://dspace.library.uu.nl:8080/handle/1874/256138.

MLA Handbook (7th Edition):

Blokland, C H M van. “Solution approaches for solving stochastic job shop and blocking job shop problems.” 2012. Web. 28 Nov 2020.

Vancouver:

Blokland CHMv. Solution approaches for solving stochastic job shop and blocking job shop problems. [Internet] [Masters thesis]. Universiteit Utrecht; 2012. [cited 2020 Nov 28]. Available from: http://dspace.library.uu.nl:8080/handle/1874/256138.

Council of Science Editors:

Blokland CHMv. Solution approaches for solving stochastic job shop and blocking job shop problems. [Masters Thesis]. Universiteit Utrecht; 2012. Available from: http://dspace.library.uu.nl:8080/handle/1874/256138


Universiteit Utrecht

17. Twist, R.P. van. Synchronizing transportation of people with reduced mobility through airport terminals.

Degree: 2015, Universiteit Utrecht

 Navigating through an airport is easy enough for most passengers, but when you are reduced in mobility it is a different story. In this paper… (more)

Subjects/Keywords: airport; PRM; reduced mobility; scheduling; decomposition model; local search; matching

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Twist, R. P. v. (2015). Synchronizing transportation of people with reduced mobility through airport terminals. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/312454

Chicago Manual of Style (16th Edition):

Twist, R P van. “Synchronizing transportation of people with reduced mobility through airport terminals.” 2015. Masters Thesis, Universiteit Utrecht. Accessed November 28, 2020. http://dspace.library.uu.nl:8080/handle/1874/312454.

MLA Handbook (7th Edition):

Twist, R P van. “Synchronizing transportation of people with reduced mobility through airport terminals.” 2015. Web. 28 Nov 2020.

Vancouver:

Twist RPv. Synchronizing transportation of people with reduced mobility through airport terminals. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2020 Nov 28]. Available from: http://dspace.library.uu.nl:8080/handle/1874/312454.

Council of Science Editors:

Twist RPv. Synchronizing transportation of people with reduced mobility through airport terminals. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/312454


Texas A&M University

18. Liu, Zhijiao. A Learning Approach for Local Expert Discovery.

Degree: MS, Computer Science, 2015, Texas A&M University

Local experts are critical for many location-sensitive information needs, and yet there is a research gap in our understanding of the factors impacting who is… (more)

Subjects/Keywords: Local expert search; Learning to rank; Twitter data mining

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, Z. (2015). A Learning Approach for Local Expert Discovery. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/156496

Chicago Manual of Style (16th Edition):

Liu, Zhijiao. “A Learning Approach for Local Expert Discovery.” 2015. Masters Thesis, Texas A&M University. Accessed November 28, 2020. http://hdl.handle.net/1969.1/156496.

MLA Handbook (7th Edition):

Liu, Zhijiao. “A Learning Approach for Local Expert Discovery.” 2015. Web. 28 Nov 2020.

Vancouver:

Liu Z. A Learning Approach for Local Expert Discovery. [Internet] [Masters thesis]. Texas A&M University; 2015. [cited 2020 Nov 28]. Available from: http://hdl.handle.net/1969.1/156496.

Council of Science Editors:

Liu Z. A Learning Approach for Local Expert Discovery. [Masters Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/156496


Penn State University

19. Borza, Gregory Michael. Local Search Algorithm for Lattice Enrichment Optimization with Heuristics.

Degree: 2015, Penn State University

 The objective of this study was to develop a lattice optimization tool to assist the loading pattern optimization of the HOLTEC SMR-160. Due to the… (more)

Subjects/Keywords: Nuclear; Lattice; Optimization; Local Search; Enrichment; Holtec; SMR

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Borza, G. M. (2015). Local Search Algorithm for Lattice Enrichment Optimization with Heuristics. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/27472

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

Borza, Gregory Michael. “Local Search Algorithm for Lattice Enrichment Optimization with Heuristics.” 2015. Thesis, Penn State University. Accessed November 28, 2020. https://submit-etda.libraries.psu.edu/catalog/27472.

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

MLA Handbook (7th Edition):

Borza, Gregory Michael. “Local Search Algorithm for Lattice Enrichment Optimization with Heuristics.” 2015. Web. 28 Nov 2020.

Vancouver:

Borza GM. Local Search Algorithm for Lattice Enrichment Optimization with Heuristics. [Internet] [Thesis]. Penn State University; 2015. [cited 2020 Nov 28]. Available from: https://submit-etda.libraries.psu.edu/catalog/27472.

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

Council of Science Editors:

Borza GM. Local Search Algorithm for Lattice Enrichment Optimization with Heuristics. [Thesis]. Penn State University; 2015. Available from: https://submit-etda.libraries.psu.edu/catalog/27472

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


Université Catholique de Louvain

20. Pham, Quang Dung. LS(Graph): a constraint-based local search framework for constrained optimum tree and path problems on graphs.

Degree: 2011, Université Catholique de Louvain

Constrained Optimum Tree (COT) and Constrained Optimum Path (COP) are two classes of problems which arise in many real-life applications and are ubiquitous in communication… (more)

Subjects/Keywords: LS(Graph); Constraint optimization; Graphs; Trees; Paths; Local search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pham, Q. D. (2011). LS(Graph): a constraint-based local search framework for constrained optimum tree and path problems on graphs. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/70746

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

Pham, Quang Dung. “LS(Graph): a constraint-based local search framework for constrained optimum tree and path problems on graphs.” 2011. Thesis, Université Catholique de Louvain. Accessed November 28, 2020. http://hdl.handle.net/2078.1/70746.

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

MLA Handbook (7th Edition):

Pham, Quang Dung. “LS(Graph): a constraint-based local search framework for constrained optimum tree and path problems on graphs.” 2011. Web. 28 Nov 2020.

Vancouver:

Pham QD. LS(Graph): a constraint-based local search framework for constrained optimum tree and path problems on graphs. [Internet] [Thesis]. Université Catholique de Louvain; 2011. [cited 2020 Nov 28]. Available from: http://hdl.handle.net/2078.1/70746.

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

Council of Science Editors:

Pham QD. LS(Graph): a constraint-based local search framework for constrained optimum tree and path problems on graphs. [Thesis]. Université Catholique de Louvain; 2011. Available from: http://hdl.handle.net/2078.1/70746

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


Brunel University

21. Alkandari, Abdulaziz. 3D packing of balls in different containers by VNS.

Degree: PhD, 2013, Brunel University

 In real world applications such as the transporting of goods products, packing is a major issue. Goods products need to be packed such that the… (more)

Subjects/Keywords: Packing spheres; Optimization; VNS algorithms; Parallel VNS; Schittkowski's local search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Alkandari, A. (2013). 3D packing of balls in different containers by VNS. (Doctoral Dissertation). Brunel University. Retrieved from http://bura.brunel.ac.uk/handle/2438/8052 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.589988

Chicago Manual of Style (16th Edition):

Alkandari, Abdulaziz. “3D packing of balls in different containers by VNS.” 2013. Doctoral Dissertation, Brunel University. Accessed November 28, 2020. http://bura.brunel.ac.uk/handle/2438/8052 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.589988.

MLA Handbook (7th Edition):

Alkandari, Abdulaziz. “3D packing of balls in different containers by VNS.” 2013. Web. 28 Nov 2020.

Vancouver:

Alkandari A. 3D packing of balls in different containers by VNS. [Internet] [Doctoral dissertation]. Brunel University; 2013. [cited 2020 Nov 28]. Available from: http://bura.brunel.ac.uk/handle/2438/8052 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.589988.

Council of Science Editors:

Alkandari A. 3D packing of balls in different containers by VNS. [Doctoral Dissertation]. Brunel University; 2013. Available from: http://bura.brunel.ac.uk/handle/2438/8052 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.589988


Delft University of Technology

22. Slotboom, Cynthia (author). The impact of soft time windows with penalties on the objective values of large real-world Vehicle Routing Problems.

Degree: 2019, Delft University of Technology

In a Vehicle Routing Problem with Time Windows (VRPTW), orders have to be picked up and delivered within certain time windows. In practice, planners often… (more)

Subjects/Keywords: VRP; Soft time windows; Real-world problems; Local search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Slotboom, C. (. (2019). The impact of soft time windows with penalties on the objective values of large real-world Vehicle Routing Problems. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:4ddd6740-2f74-4fcd-aa9f-c0477015f5ba

Chicago Manual of Style (16th Edition):

Slotboom, Cynthia (author). “The impact of soft time windows with penalties on the objective values of large real-world Vehicle Routing Problems.” 2019. Masters Thesis, Delft University of Technology. Accessed November 28, 2020. http://resolver.tudelft.nl/uuid:4ddd6740-2f74-4fcd-aa9f-c0477015f5ba.

MLA Handbook (7th Edition):

Slotboom, Cynthia (author). “The impact of soft time windows with penalties on the objective values of large real-world Vehicle Routing Problems.” 2019. Web. 28 Nov 2020.

Vancouver:

Slotboom C(. The impact of soft time windows with penalties on the objective values of large real-world Vehicle Routing Problems. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2020 Nov 28]. Available from: http://resolver.tudelft.nl/uuid:4ddd6740-2f74-4fcd-aa9f-c0477015f5ba.

Council of Science Editors:

Slotboom C(. The impact of soft time windows with penalties on the objective values of large real-world Vehicle Routing Problems. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:4ddd6740-2f74-4fcd-aa9f-c0477015f5ba


University of Western Ontario

23. Mallik, Arnab. Computation of Sensitive Multiple Spaced Seeds.

Degree: 2020, University of Western Ontario

 Similarity search is one of the most important problem in bioinformatics, with application in read mapping, homology search, oligonucleotide design, etc. Similarity search is time… (more)

Subjects/Keywords: Multiple Spaced Seeds; Similarity Search; Local Alignment; Heuristic Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mallik, A. (2020). Computation of Sensitive Multiple Spaced Seeds. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/6977

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

Mallik, Arnab. “Computation of Sensitive Multiple Spaced Seeds.” 2020. Thesis, University of Western Ontario. Accessed November 28, 2020. https://ir.lib.uwo.ca/etd/6977.

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

MLA Handbook (7th Edition):

Mallik, Arnab. “Computation of Sensitive Multiple Spaced Seeds.” 2020. Web. 28 Nov 2020.

Vancouver:

Mallik A. Computation of Sensitive Multiple Spaced Seeds. [Internet] [Thesis]. University of Western Ontario; 2020. [cited 2020 Nov 28]. Available from: https://ir.lib.uwo.ca/etd/6977.

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

Council of Science Editors:

Mallik A. Computation of Sensitive Multiple Spaced Seeds. [Thesis]. University of Western Ontario; 2020. Available from: https://ir.lib.uwo.ca/etd/6977

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

24. Sohanghpurwala, Ali Asgar Ali Akbar. Exploits in Concurrency for Boolean Satisfiability.

Degree: PhD, Computer Engineering, 2018, Virginia Tech

 Boolean Satisfiability (SAT) is a problem that holds great theoretical significance along with effective formulations that benefit many real-world applications. While the general problem is… (more)

Subjects/Keywords: Satisfiability; FPGA; SLS; MaxSAT; Parallel Local Search; SAT

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

Sohanghpurwala, A. A. A. A. (2018). Exploits in Concurrency for Boolean Satisfiability. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/86417

Chicago Manual of Style (16th Edition):

Sohanghpurwala, Ali Asgar Ali Akbar. “Exploits in Concurrency for Boolean Satisfiability.” 2018. Doctoral Dissertation, Virginia Tech. Accessed November 28, 2020. http://hdl.handle.net/10919/86417.

MLA Handbook (7th Edition):

Sohanghpurwala, Ali Asgar Ali Akbar. “Exploits in Concurrency for Boolean Satisfiability.” 2018. Web. 28 Nov 2020.

Vancouver:

Sohanghpurwala AAAA. Exploits in Concurrency for Boolean Satisfiability. [Internet] [Doctoral dissertation]. Virginia Tech; 2018. [cited 2020 Nov 28]. Available from: http://hdl.handle.net/10919/86417.

Council of Science Editors:

Sohanghpurwala AAAA. Exploits in Concurrency for Boolean Satisfiability. [Doctoral Dissertation]. Virginia Tech; 2018. Available from: http://hdl.handle.net/10919/86417


Colorado State University

25. Chen, Wenxiang. Step toward constant time local search for optimizing pseudo boolean functions, A.

Degree: MS(M.S.), Computer Science, 2013, Colorado State University

 Pseudo Boolean Functions (PBFs) are the objective functions for a wide class of hard optimization problems, such as MAX-SAT and MAX-CUT. Since these problems are… (more)

Subjects/Keywords: complexity per move; stochastic local search; pseudo Boolean optimization; NK-landscapes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, W. (2013). Step toward constant time local search for optimizing pseudo boolean functions, A. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/81007

Chicago Manual of Style (16th Edition):

Chen, Wenxiang. “Step toward constant time local search for optimizing pseudo boolean functions, A.” 2013. Masters Thesis, Colorado State University. Accessed November 28, 2020. http://hdl.handle.net/10217/81007.

MLA Handbook (7th Edition):

Chen, Wenxiang. “Step toward constant time local search for optimizing pseudo boolean functions, A.” 2013. Web. 28 Nov 2020.

Vancouver:

Chen W. Step toward constant time local search for optimizing pseudo boolean functions, A. [Internet] [Masters thesis]. Colorado State University; 2013. [cited 2020 Nov 28]. Available from: http://hdl.handle.net/10217/81007.

Council of Science Editors:

Chen W. Step toward constant time local search for optimizing pseudo boolean functions, A. [Masters Thesis]. Colorado State University; 2013. Available from: http://hdl.handle.net/10217/81007


Queensland University of Technology

26. Mousavi Nogholi, Amin Alah. Optimisation of open pit mine block sequencing.

Degree: 2015, Queensland University of Technology

 This study presents a comprehensive mathematical model for open pit mine block sequencing problem which considers technical aspects of real-life mine operations. As the open… (more)

Subjects/Keywords: Mining; Block Sequencing; Open Pit; Optimisation; Simulated Annealing; Tabu Search; Hybrid Heuristic; Local Search; Stockpile; Heuristic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mousavi Nogholi, A. A. (2015). Optimisation of open pit mine block sequencing. (Thesis). Queensland University of Technology. Retrieved from https://eprints.qut.edu.au/86697/

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

Mousavi Nogholi, Amin Alah. “Optimisation of open pit mine block sequencing.” 2015. Thesis, Queensland University of Technology. Accessed November 28, 2020. https://eprints.qut.edu.au/86697/.

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

MLA Handbook (7th Edition):

Mousavi Nogholi, Amin Alah. “Optimisation of open pit mine block sequencing.” 2015. Web. 28 Nov 2020.

Vancouver:

Mousavi Nogholi AA. Optimisation of open pit mine block sequencing. [Internet] [Thesis]. Queensland University of Technology; 2015. [cited 2020 Nov 28]. Available from: https://eprints.qut.edu.au/86697/.

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

Council of Science Editors:

Mousavi Nogholi AA. Optimisation of open pit mine block sequencing. [Thesis]. Queensland University of Technology; 2015. Available from: https://eprints.qut.edu.au/86697/

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


University of Georgia

27. Walliser, Michael Anthony. Fort Stewart shortest path analysis of debris cleanup options.

Degree: 2014, University of Georgia

 Several heuristic algorithms are developed to find the fastest set of routes in order for a fleet of cleanup crews to clear hurricane-related debris from… (more)

Subjects/Keywords: Arc routing; Hierarchical Chinese Postman Problem; Capacitated Arc Routing Problem; Path finding; Search heuristics; Local beam search; Genetic algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Walliser, M. A. (2014). Fort Stewart shortest path analysis of debris cleanup options. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/28149

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

Walliser, Michael Anthony. “Fort Stewart shortest path analysis of debris cleanup options.” 2014. Thesis, University of Georgia. Accessed November 28, 2020. http://hdl.handle.net/10724/28149.

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

MLA Handbook (7th Edition):

Walliser, Michael Anthony. “Fort Stewart shortest path analysis of debris cleanup options.” 2014. Web. 28 Nov 2020.

Vancouver:

Walliser MA. Fort Stewart shortest path analysis of debris cleanup options. [Internet] [Thesis]. University of Georgia; 2014. [cited 2020 Nov 28]. Available from: http://hdl.handle.net/10724/28149.

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

Council of Science Editors:

Walliser MA. Fort Stewart shortest path analysis of debris cleanup options. [Thesis]. University of Georgia; 2014. Available from: http://hdl.handle.net/10724/28149

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

28. Melo, Everton Luiz de. Meta-heurísticas Iterated Local Search, GRASP e Artificial Bee Colony aplicadas ao Job Shop Flexível para minimização do atraso total.

Degree: PhD, Engenharia de Produção, 2014, University of São Paulo

O ambiente de produção abordado neste trabalho é o Job Shop Flexível (JSF), uma generalização do Job Shop (JS). O problema de programação de tarefas,… (more)

Subjects/Keywords: Artificial Bee Colony; Artificial Bee Colony; Atraso total; Busca Local; Constructive heuristic; Flexible Job shop; GRASP; GRASP; Heurística construtiva; Iterated Local Search; Iterated Local Search; Job shop flexível; Local search; Meta-heurística; Metaheuristic; Mixed Integer Linear Programming; Programação de tarefas; Programação Linear Inteira Mista; Scheduling; Total tardiness

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Melo, E. L. d. (2014). Meta-heurísticas Iterated Local Search, GRASP e Artificial Bee Colony aplicadas ao Job Shop Flexível para minimização do atraso total. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/3/3136/tde-15122014-002717/ ;

Chicago Manual of Style (16th Edition):

Melo, Everton Luiz de. “Meta-heurísticas Iterated Local Search, GRASP e Artificial Bee Colony aplicadas ao Job Shop Flexível para minimização do atraso total.” 2014. Doctoral Dissertation, University of São Paulo. Accessed November 28, 2020. http://www.teses.usp.br/teses/disponiveis/3/3136/tde-15122014-002717/ ;.

MLA Handbook (7th Edition):

Melo, Everton Luiz de. “Meta-heurísticas Iterated Local Search, GRASP e Artificial Bee Colony aplicadas ao Job Shop Flexível para minimização do atraso total.” 2014. Web. 28 Nov 2020.

Vancouver:

Melo ELd. Meta-heurísticas Iterated Local Search, GRASP e Artificial Bee Colony aplicadas ao Job Shop Flexível para minimização do atraso total. [Internet] [Doctoral dissertation]. University of São Paulo; 2014. [cited 2020 Nov 28]. Available from: http://www.teses.usp.br/teses/disponiveis/3/3136/tde-15122014-002717/ ;.

Council of Science Editors:

Melo ELd. Meta-heurísticas Iterated Local Search, GRASP e Artificial Bee Colony aplicadas ao Job Shop Flexível para minimização do atraso total. [Doctoral Dissertation]. University of São Paulo; 2014. Available from: http://www.teses.usp.br/teses/disponiveis/3/3136/tde-15122014-002717/ ;

29. Rosin, Rafael Alzuguir. Heurística com busca local para solução do problema de cobertura de rotas com cardinalidade restrita.

Degree: Mestrado, Engenharia de Sistemas Logísticos, 2011, University of São Paulo

A crescente necessidade de buscar operações mais eficientes, com menor custo e mais sustentáveis tem feito com que empresas passassem a procurar oportunidades pelas quais… (more)

Subjects/Keywords: Busca local; Collaborative logistics; Heurística; Heuristics; Lane covering problem; Local search; Logística colaborativa; Problema de cobertura de rotas

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rosin, R. A. (2011). Heurística com busca local para solução do problema de cobertura de rotas com cardinalidade restrita. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/3/3148/tde-30032012-122542/ ;

Chicago Manual of Style (16th Edition):

Rosin, Rafael Alzuguir. “Heurística com busca local para solução do problema de cobertura de rotas com cardinalidade restrita.” 2011. Masters Thesis, University of São Paulo. Accessed November 28, 2020. http://www.teses.usp.br/teses/disponiveis/3/3148/tde-30032012-122542/ ;.

MLA Handbook (7th Edition):

Rosin, Rafael Alzuguir. “Heurística com busca local para solução do problema de cobertura de rotas com cardinalidade restrita.” 2011. Web. 28 Nov 2020.

Vancouver:

Rosin RA. Heurística com busca local para solução do problema de cobertura de rotas com cardinalidade restrita. [Internet] [Masters thesis]. University of São Paulo; 2011. [cited 2020 Nov 28]. Available from: http://www.teses.usp.br/teses/disponiveis/3/3148/tde-30032012-122542/ ;.

Council of Science Editors:

Rosin RA. Heurística com busca local para solução do problema de cobertura de rotas com cardinalidade restrita. [Masters Thesis]. University of São Paulo; 2011. Available from: http://www.teses.usp.br/teses/disponiveis/3/3148/tde-30032012-122542/ ;


NSYSU

30. Liu, Wei-Yi. Comparison of Classification Effects between Principal Component and Multilinear Principal Component Analysis for Study of Cardiology Ultrasound in Left Ventricle.

Degree: Master, Applied Mathematics, 2013, NSYSU

 In this work, we study heart diseases related to diastolic and systolic of heart in left ventricle. Following Chen(2012) and Yang(2012), the differences between the… (more)

Subjects/Keywords: gray-scale value; local search procedure; multilinear principal component analysis; regularized discriminant analysis; factor score

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, W. (2013). Comparison of Classification Effects between Principal Component and Multilinear Principal Component Analysis for Study of Cardiology Ultrasound in Left Ventricle. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0602113-115756

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

Liu, Wei-Yi. “Comparison of Classification Effects between Principal Component and Multilinear Principal Component Analysis for Study of Cardiology Ultrasound in Left Ventricle.” 2013. Thesis, NSYSU. Accessed November 28, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0602113-115756.

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

MLA Handbook (7th Edition):

Liu, Wei-Yi. “Comparison of Classification Effects between Principal Component and Multilinear Principal Component Analysis for Study of Cardiology Ultrasound in Left Ventricle.” 2013. Web. 28 Nov 2020.

Vancouver:

Liu W. Comparison of Classification Effects between Principal Component and Multilinear Principal Component Analysis for Study of Cardiology Ultrasound in Left Ventricle. [Internet] [Thesis]. NSYSU; 2013. [cited 2020 Nov 28]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0602113-115756.

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

Council of Science Editors:

Liu W. Comparison of Classification Effects between Principal Component and Multilinear Principal Component Analysis for Study of Cardiology Ultrasound in Left Ventricle. [Thesis]. NSYSU; 2013. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0602113-115756

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

[1] [2] [3] [4] [5] [6] [7]

.