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

Language: English

You searched for +publisher:"Colorado State University" +contributor:("Whitley, L. Darrell"). Showing records 1 – 9 of 9 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Colorado State University

1. 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 February 28, 2021. http://hdl.handle.net/10217/47314.

MLA Handbook (7th Edition):

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

Vancouver:

Hains DR. Generalized partition crossover for the traveling salesman problem. [Internet] [Masters thesis]. Colorado State University; 2011. [cited 2021 Feb 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


Colorado State University

2. 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 February 28, 2021. 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 Feb 2021.

Vancouver:

Chen W. Step toward constant time local search for optimizing pseudo boolean functions, A. [Internet] [Masters thesis]. Colorado State University; 2013. [cited 2021 Feb 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


Colorado State University

3. 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 February 28, 2021. 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 Feb 2021.

Vancouver:

Sutton AM. Analysis of combinatorial search spaces for a class of NP-hard problems, An. [Internet] [Doctoral dissertation]. Colorado State University; 2011. [cited 2021 Feb 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


Colorado State University

4. 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 February 28, 2021. http://hdl.handle.net/10217/189292.

MLA Handbook (7th Edition):

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

Vancouver:

Chen W. Discovering and harnessing structures in solving application satisfiability instances. [Internet] [Doctoral dissertation]. Colorado State University; 2018. [cited 2021 Feb 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

5. Whyman, Paul Arthur. Automatic endpoint vulnerability detection of Linux and open source using the National Vulnerability Database.

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

 A means to reduce security risks to a network of computers is to manage which computers can participate on a network, and control the participation… (more)

Subjects/Keywords: Open source software; Computer security

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Whyman, P. A. (2008). Automatic endpoint vulnerability detection of Linux and open source using the National Vulnerability Database. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/80811

Chicago Manual of Style (16th Edition):

Whyman, Paul Arthur. “Automatic endpoint vulnerability detection of Linux and open source using the National Vulnerability Database.” 2008. Masters Thesis, Colorado State University. Accessed February 28, 2021. http://hdl.handle.net/10217/80811.

MLA Handbook (7th Edition):

Whyman, Paul Arthur. “Automatic endpoint vulnerability detection of Linux and open source using the National Vulnerability Database.” 2008. Web. 28 Feb 2021.

Vancouver:

Whyman PA. Automatic endpoint vulnerability detection of Linux and open source using the National Vulnerability Database. [Internet] [Masters thesis]. Colorado State University; 2008. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/10217/80811.

Council of Science Editors:

Whyman PA. Automatic endpoint vulnerability detection of Linux and open source using the National Vulnerability Database. [Masters Thesis]. Colorado State University; 2008. Available from: http://hdl.handle.net/10217/80811


Colorado State University

6. Dewri, Rinku. Multi-criteria analysis in modern information management.

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

 The past few years have witnessed an overwhelming amount of research in the field of information security and privacy. An encouraging outcome of this research… (more)

Subjects/Keywords: Information management; data broadcasting; multi-objective optimization; information security and privacy; Computer networks  – Security measures; Computer security; Multiple criteria decision making

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dewri, R. (2010). Multi-criteria analysis in modern information management. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/40284

Chicago Manual of Style (16th Edition):

Dewri, Rinku. “Multi-criteria analysis in modern information management.” 2010. Doctoral Dissertation, Colorado State University. Accessed February 28, 2021. http://hdl.handle.net/10217/40284.

MLA Handbook (7th Edition):

Dewri, Rinku. “Multi-criteria analysis in modern information management.” 2010. Web. 28 Feb 2021.

Vancouver:

Dewri R. Multi-criteria analysis in modern information management. [Internet] [Doctoral dissertation]. Colorado State University; 2010. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/10217/40284.

Council of Science Editors:

Dewri R. Multi-criteria analysis in modern information management. [Doctoral Dissertation]. Colorado State University; 2010. Available from: http://hdl.handle.net/10217/40284


Colorado State University

7. Watson, Jean-Paul. Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem.

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

 Local search algorithms are among the most effective approaches for locating high-quality solutions to a wide range of combinatorial optimization problems. However, our theoretical understanding… (more)

Subjects/Keywords: random walk; tabu search; job-shop scheduling problem; empirical methods; local search algorithms; iterated local search; simulated annealing; Production scheduling  – Computer simulation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Watson, J. (2003). Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/26811

Chicago Manual of Style (16th Edition):

Watson, Jean-Paul. “Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem.” 2003. Doctoral Dissertation, Colorado State University. Accessed February 28, 2021. http://hdl.handle.net/10217/26811.

MLA Handbook (7th Edition):

Watson, Jean-Paul. “Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem.” 2003. Web. 28 Feb 2021.

Vancouver:

Watson J. Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem. [Internet] [Doctoral dissertation]. Colorado State University; 2003. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/10217/26811.

Council of Science Editors:

Watson J. Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem. [Doctoral Dissertation]. Colorado State University; 2003. Available from: http://hdl.handle.net/10217/26811


Colorado State University

8. Kretchmar, R. Matthew. Synthesis of reinforcement learning and robust control theory, A.

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

 The pursuit of control algorithms with improved performance drives the entire control research community as well as large parts of the mathematics, engineering, and artificial… (more)

Subjects/Keywords: robust control theory; neuro-control scheme; neuro-controller; neural networks; Reinforcement learning; Control theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kretchmar, R. M. (2000). Synthesis of reinforcement learning and robust control theory, A. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/26305

Chicago Manual of Style (16th Edition):

Kretchmar, R Matthew. “Synthesis of reinforcement learning and robust control theory, A.” 2000. Doctoral Dissertation, Colorado State University. Accessed February 28, 2021. http://hdl.handle.net/10217/26305.

MLA Handbook (7th Edition):

Kretchmar, R Matthew. “Synthesis of reinforcement learning and robust control theory, A.” 2000. Web. 28 Feb 2021.

Vancouver:

Kretchmar RM. Synthesis of reinforcement learning and robust control theory, A. [Internet] [Doctoral dissertation]. Colorado State University; 2000. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/10217/26305.

Council of Science Editors:

Kretchmar RM. Synthesis of reinforcement learning and robust control theory, A. [Doctoral Dissertation]. Colorado State University; 2000. Available from: http://hdl.handle.net/10217/26305


Colorado State University

9. Lui, Yui Man. Geometric methods on special manifolds for visual recognition.

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

 Many computer vision methods assume that the underlying geometry of images is Euclidean. This assumption is generally not valid. Therefore, this dissertation introduces new nonlinear… (more)

Subjects/Keywords: action classification; visual recognition; special manifolds; geometric methods; face recognition; Human face recognition (Computer science); Grassmann manifolds; Stiefel manifolds

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lui, Y. M. (2010). Geometric methods on special manifolds for visual recognition. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/39042

Chicago Manual of Style (16th Edition):

Lui, Yui Man. “Geometric methods on special manifolds for visual recognition.” 2010. Doctoral Dissertation, Colorado State University. Accessed February 28, 2021. http://hdl.handle.net/10217/39042.

MLA Handbook (7th Edition):

Lui, Yui Man. “Geometric methods on special manifolds for visual recognition.” 2010. Web. 28 Feb 2021.

Vancouver:

Lui YM. Geometric methods on special manifolds for visual recognition. [Internet] [Doctoral dissertation]. Colorado State University; 2010. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/10217/39042.

Council of Science Editors:

Lui YM. Geometric methods on special manifolds for visual recognition. [Doctoral Dissertation]. Colorado State University; 2010. Available from: http://hdl.handle.net/10217/39042

.