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 +publisher:"Colorado State University" +contributor:("Howe, Adele E."). Showing records 1 – 8 of 8 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Colorado State University

1. Urbanska, Malgorzata. Automated security analysis of the home computer.

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

 Home computer users pose special challenges to the security of their machines. Often home computer users do not realize that their computer activities have repercussions… (more)

Subjects/Keywords: attacks and defenses; attack graphs; security personalization; security risk modeling; system security; vulnerability database

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Urbanska, M. (2014). Automated security analysis of the home computer. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/82538

Chicago Manual of Style (16th Edition):

Urbanska, Malgorzata. “Automated security analysis of the home computer.” 2014. Masters Thesis, Colorado State University. Accessed March 09, 2021. http://hdl.handle.net/10217/82538.

MLA Handbook (7th Edition):

Urbanska, Malgorzata. “Automated security analysis of the home computer.” 2014. Web. 09 Mar 2021.

Vancouver:

Urbanska M. Automated security analysis of the home computer. [Internet] [Masters thesis]. Colorado State University; 2014. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10217/82538.

Council of Science Editors:

Urbanska M. Automated security analysis of the home computer. [Masters Thesis]. Colorado State University; 2014. Available from: http://hdl.handle.net/10217/82538


Colorado State University

2. 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 March 09, 2021. http://hdl.handle.net/10217/47314.

MLA Handbook (7th Edition):

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

Vancouver:

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

3. 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 March 09, 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. 09 Mar 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 Mar 09]. 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

4. Barber, Michael J. Classification ensemble methods for mitigating concept drift within online data streams.

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

 The task of instance classification within very large data streams is challenged by both the overwhelming amount of data, and a phenomenon known as concept… (more)

Subjects/Keywords: data mining; online analysis; machine learning; ensembles

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Barber, M. J. (2012). Classification ensemble methods for mitigating concept drift within online data streams. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/67994

Chicago Manual of Style (16th Edition):

Barber, Michael J. “Classification ensemble methods for mitigating concept drift within online data streams.” 2012. Masters Thesis, Colorado State University. Accessed March 09, 2021. http://hdl.handle.net/10217/67994.

MLA Handbook (7th Edition):

Barber, Michael J. “Classification ensemble methods for mitigating concept drift within online data streams.” 2012. Web. 09 Mar 2021.

Vancouver:

Barber MJ. Classification ensemble methods for mitigating concept drift within online data streams. [Internet] [Masters thesis]. Colorado State University; 2012. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10217/67994.

Council of Science Editors:

Barber MJ. Classification ensemble methods for mitigating concept drift within online data streams. [Masters Thesis]. Colorado State University; 2012. Available from: http://hdl.handle.net/10217/67994


Colorado State University

5. 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 March 09, 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. 09 Mar 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 Mar 09]. 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

6. Sojda, Richard S. Artificial intelligence based decision support for trumpeter swan management.

Degree: PhD, Forest Sciences, 2002, Colorado State University

 The number of trumpeter swans (Cygnus buccinator) breeding in the Tri-State area where Montana, Idaho, and Wyoming come together has declined to just a few… (more)

Subjects/Keywords: waterfowl ecology; Rocky Mountain trumpeter swans; ecological decision support systems; swan management; distributed environment centered agent framework; (DECAF); Trumpeter swan; Waterfowl management; Decision support systems; Cygnus buccinator

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sojda, R. S. (2002). Artificial intelligence based decision support for trumpeter swan management. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/954

Chicago Manual of Style (16th Edition):

Sojda, Richard S. “Artificial intelligence based decision support for trumpeter swan management.” 2002. Doctoral Dissertation, Colorado State University. Accessed March 09, 2021. http://hdl.handle.net/10217/954.

MLA Handbook (7th Edition):

Sojda, Richard S. “Artificial intelligence based decision support for trumpeter swan management.” 2002. Web. 09 Mar 2021.

Vancouver:

Sojda RS. Artificial intelligence based decision support for trumpeter swan management. [Internet] [Doctoral dissertation]. Colorado State University; 2002. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10217/954.

Council of Science Editors:

Sojda RS. Artificial intelligence based decision support for trumpeter swan management. [Doctoral Dissertation]. Colorado State University; 2002. Available from: http://hdl.handle.net/10217/954


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 March 09, 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. 09 Mar 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 Mar 09]. 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 March 09, 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. 09 Mar 2021.

Vancouver:

Kretchmar RM. Synthesis of reinforcement learning and robust control theory, A. [Internet] [Doctoral dissertation]. Colorado State University; 2000. [cited 2021 Mar 09]. 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

.