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:"Oregon State University" +contributor:("Cull, Paul"). Showing records 1 – 30 of 31 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

▼ Search Limiters


Oregon State University

1. Holloway, James Lee. Algorithms for string matching with applications in molecular biology.

Degree: PhD, Computer Science, 2009, Oregon State University

 As the volume of genetic sequence data increases due to improved sequencing techniques and increased interest, the computational tools available to analyze the data are… (more)

Subjects/Keywords: Nucleotide sequence  – Data processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Holloway, J. L. (2009). Algorithms for string matching with applications in molecular biology. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/11518

Chicago Manual of Style (16th Edition):

Holloway, James Lee. “Algorithms for string matching with applications in molecular biology.” 2009. Doctoral Dissertation, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/11518.

MLA Handbook (7th Edition):

Holloway, James Lee. “Algorithms for string matching with applications in molecular biology.” 2009. Web. 15 Apr 2021.

Vancouver:

Holloway JL. Algorithms for string matching with applications in molecular biology. [Internet] [Doctoral dissertation]. Oregon State University; 2009. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/11518.

Council of Science Editors:

Holloway JL. Algorithms for string matching with applications in molecular biology. [Doctoral Dissertation]. Oregon State University; 2009. Available from: http://hdl.handle.net/1957/11518

2. Bjarnason, Ronald V. Monte-Carlo planning for probabilistic domains.

Degree: PhD, Computer Science, 2009, Oregon State University

 This thesis presents a progression of novel planning algorithms that culminates in a new family of diverse Monte-Carlo methods for probabilistic planning domains. We provide… (more)

Subjects/Keywords: Artificial Intelligence; Monte-Carlo method

…permanent collection of Oregon State University libraries. My signature below authorizes release… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bjarnason, R. V. (2009). Monte-Carlo planning for probabilistic domains. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/13657

Chicago Manual of Style (16th Edition):

Bjarnason, Ronald V. “Monte-Carlo planning for probabilistic domains.” 2009. Doctoral Dissertation, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/13657.

MLA Handbook (7th Edition):

Bjarnason, Ronald V. “Monte-Carlo planning for probabilistic domains.” 2009. Web. 15 Apr 2021.

Vancouver:

Bjarnason RV. Monte-Carlo planning for probabilistic domains. [Internet] [Doctoral dissertation]. Oregon State University; 2009. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/13657.

Council of Science Editors:

Bjarnason RV. Monte-Carlo planning for probabilistic domains. [Doctoral Dissertation]. Oregon State University; 2009. Available from: http://hdl.handle.net/1957/13657

3. Bauer, Tim (Timothy R.). Adaptation-based programming.

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

 Partial programming is a field of study where users specify an outline or skeleton of a program, but leave various parts undefined. The undefined parts… (more)

Subjects/Keywords: Partial Programming; Programming languages (Electronic computers)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bauer, T. (. R. ). (2013). Adaptation-based programming. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/37365

Chicago Manual of Style (16th Edition):

Bauer, Tim (Timothy R ). “Adaptation-based programming.” 2013. Doctoral Dissertation, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/37365.

MLA Handbook (7th Edition):

Bauer, Tim (Timothy R ). “Adaptation-based programming.” 2013. Web. 15 Apr 2021.

Vancouver:

Bauer T(R). Adaptation-based programming. [Internet] [Doctoral dissertation]. Oregon State University; 2013. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/37365.

Council of Science Editors:

Bauer T(R). Adaptation-based programming. [Doctoral Dissertation]. Oregon State University; 2013. Available from: http://hdl.handle.net/1957/37365


Oregon State University

4. Ruby, Glenn Russell. An algebraic view of the symmetry of fast transforms.

Degree: MS, Computer Science, 1982, Oregon State University

 Why are the fast Fourier transform and the fast Hadamard transform fast? A transform can be computed by multiplying a matrix times a vector, which… (more)

Subjects/Keywords: Transformations (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ruby, G. R. (1982). An algebraic view of the symmetry of fast transforms. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/41738

Chicago Manual of Style (16th Edition):

Ruby, Glenn Russell. “An algebraic view of the symmetry of fast transforms.” 1982. Masters Thesis, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/41738.

MLA Handbook (7th Edition):

Ruby, Glenn Russell. “An algebraic view of the symmetry of fast transforms.” 1982. Web. 15 Apr 2021.

Vancouver:

Ruby GR. An algebraic view of the symmetry of fast transforms. [Internet] [Masters thesis]. Oregon State University; 1982. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/41738.

Council of Science Editors:

Ruby GR. An algebraic view of the symmetry of fast transforms. [Masters Thesis]. Oregon State University; 1982. Available from: http://hdl.handle.net/1957/41738


Oregon State University

5. Kinion, Paul A. Uniform Hamiltonian touring sequences.

Degree: MS, Mathematics, 1982, Oregon State University

 Sequential machines uniquely determine directed graphs. A path in a sequential machine may be specified by a starting state and an input sequence. A uniform… (more)

Subjects/Keywords: Sequential machine theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kinion, P. A. (1982). Uniform Hamiltonian touring sequences. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/41963

Chicago Manual of Style (16th Edition):

Kinion, Paul A. “Uniform Hamiltonian touring sequences.” 1982. Masters Thesis, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/41963.

MLA Handbook (7th Edition):

Kinion, Paul A. “Uniform Hamiltonian touring sequences.” 1982. Web. 15 Apr 2021.

Vancouver:

Kinion PA. Uniform Hamiltonian touring sequences. [Internet] [Masters thesis]. Oregon State University; 1982. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/41963.

Council of Science Editors:

Kinion PA. Uniform Hamiltonian touring sequences. [Masters Thesis]. Oregon State University; 1982. Available from: http://hdl.handle.net/1957/41963


Oregon State University

6. Starr, Robert W. A multi-tour heuristic for the traveling salesman problem.

Degree: MS, Computer Science, 1980, Oregon State University

 This paper demonstrates the effectiveness of a heuristic for the Traveling Salesman Problem based purely on the efficient storage of multiple partial sub-tours. The heuristic… (more)

Subjects/Keywords: Traveling-salesman problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Starr, R. W. (1980). A multi-tour heuristic for the traveling salesman problem. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/42577

Chicago Manual of Style (16th Edition):

Starr, Robert W. “A multi-tour heuristic for the traveling salesman problem.” 1980. Masters Thesis, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/42577.

MLA Handbook (7th Edition):

Starr, Robert W. “A multi-tour heuristic for the traveling salesman problem.” 1980. Web. 15 Apr 2021.

Vancouver:

Starr RW. A multi-tour heuristic for the traveling salesman problem. [Internet] [Masters thesis]. Oregon State University; 1980. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/42577.

Council of Science Editors:

Starr RW. A multi-tour heuristic for the traveling salesman problem. [Masters Thesis]. Oregon State University; 1980. Available from: http://hdl.handle.net/1957/42577


Oregon State University

7. McAlister, Richard Earl. Knots : a measure of program complexity.

Degree: MS, Computer Science, 1980, Oregon State University

 Most measures of program complexity gauge either textual or control flow attributes of a program. A recent addition to the field of complexity measures, the… (more)

Subjects/Keywords: Computer programs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McAlister, R. E. (1980). Knots : a measure of program complexity. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/43016

Chicago Manual of Style (16th Edition):

McAlister, Richard Earl. “Knots : a measure of program complexity.” 1980. Masters Thesis, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/43016.

MLA Handbook (7th Edition):

McAlister, Richard Earl. “Knots : a measure of program complexity.” 1980. Web. 15 Apr 2021.

Vancouver:

McAlister RE. Knots : a measure of program complexity. [Internet] [Masters thesis]. Oregon State University; 1980. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/43016.

Council of Science Editors:

McAlister RE. Knots : a measure of program complexity. [Masters Thesis]. Oregon State University; 1980. Available from: http://hdl.handle.net/1957/43016


Oregon State University

8. Holloway, J. L. Algorithms for computing Fibonacci numbers quickly.

Degree: MS, Computer Science, 1988, Oregon State University

 A study of the running time of several known algorithms and several new algorithms to compute the n[superscript th] element of the Fibonacci sequence is… (more)

Subjects/Keywords: Fibonacci numbers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Holloway, J. L. (1988). Algorithms for computing Fibonacci numbers quickly. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/39942

Chicago Manual of Style (16th Edition):

Holloway, J L. “Algorithms for computing Fibonacci numbers quickly.” 1988. Masters Thesis, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/39942.

MLA Handbook (7th Edition):

Holloway, J L. “Algorithms for computing Fibonacci numbers quickly.” 1988. Web. 15 Apr 2021.

Vancouver:

Holloway JL. Algorithms for computing Fibonacci numbers quickly. [Internet] [Masters thesis]. Oregon State University; 1988. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/39942.

Council of Science Editors:

Holloway JL. Algorithms for computing Fibonacci numbers quickly. [Masters Thesis]. Oregon State University; 1988. Available from: http://hdl.handle.net/1957/39942


Oregon State University

9. Colby, Jonathan Axford. The FLEX/REFLEX paradigm and its application to computer program systems.

Degree: MS, Computer Science, 1976, Oregon State University

 The FLEX/REFLEX paradigm is applied to the description of a computer program system. The paradigm is shown to be relevant and appropriate to computer program… (more)

Subjects/Keywords: Operating systems (Computers)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Colby, J. A. (1976). The FLEX/REFLEX paradigm and its application to computer program systems. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/43460

Chicago Manual of Style (16th Edition):

Colby, Jonathan Axford. “The FLEX/REFLEX paradigm and its application to computer program systems.” 1976. Masters Thesis, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/43460.

MLA Handbook (7th Edition):

Colby, Jonathan Axford. “The FLEX/REFLEX paradigm and its application to computer program systems.” 1976. Web. 15 Apr 2021.

Vancouver:

Colby JA. The FLEX/REFLEX paradigm and its application to computer program systems. [Internet] [Masters thesis]. Oregon State University; 1976. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/43460.

Council of Science Editors:

Colby JA. The FLEX/REFLEX paradigm and its application to computer program systems. [Masters Thesis]. Oregon State University; 1976. Available from: http://hdl.handle.net/1957/43460


Oregon State University

10. Hsu, Tai C. Walking tree methods for biological string matching.

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

Subjects/Keywords: Matching theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hsu, T. C. (2003). Walking tree methods for biological string matching. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/32486

Chicago Manual of Style (16th Edition):

Hsu, Tai C. “Walking tree methods for biological string matching.” 2003. Doctoral Dissertation, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/32486.

MLA Handbook (7th Edition):

Hsu, Tai C. “Walking tree methods for biological string matching.” 2003. Web. 15 Apr 2021.

Vancouver:

Hsu TC. Walking tree methods for biological string matching. [Internet] [Doctoral dissertation]. Oregon State University; 2003. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/32486.

Council of Science Editors:

Hsu TC. Walking tree methods for biological string matching. [Doctoral Dissertation]. Oregon State University; 2003. Available from: http://hdl.handle.net/1957/32486


Oregon State University

11. Leegard, Amanda D. A fast algorithm for determining the primitivity of an n x n nonnegative matrix.

Degree: MS, Computer Science, 2002, Oregon State University

 Nonnegative matrices have a myriad of applications in the biological, social, and physical genres. Of particular importance are the primitive matrices. A nonnegative matrix, M,… (more)

Subjects/Keywords: Non-negative matrices

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Leegard, A. D. (2002). A fast algorithm for determining the primitivity of an n x n nonnegative matrix. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/31568

Chicago Manual of Style (16th Edition):

Leegard, Amanda D. “A fast algorithm for determining the primitivity of an n x n nonnegative matrix.” 2002. Masters Thesis, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/31568.

MLA Handbook (7th Edition):

Leegard, Amanda D. “A fast algorithm for determining the primitivity of an n x n nonnegative matrix.” 2002. Web. 15 Apr 2021.

Vancouver:

Leegard AD. A fast algorithm for determining the primitivity of an n x n nonnegative matrix. [Internet] [Masters thesis]. Oregon State University; 2002. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/31568.

Council of Science Editors:

Leegard AD. A fast algorithm for determining the primitivity of an n x n nonnegative matrix. [Masters Thesis]. Oregon State University; 2002. Available from: http://hdl.handle.net/1957/31568


Oregon State University

12. Djang, Kevin. An alternative architecture for performing basic computer arithmetical operations.

Degree: MS, Computer Science, 2000, Oregon State University

 The arithmetic portions of almost all modern processor architectures are of very similar design. We use the term "traditional" to describe this design, the primary… (more)

Subjects/Keywords: Computer arithmetic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Djang, K. (2000). An alternative architecture for performing basic computer arithmetical operations. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/33066

Chicago Manual of Style (16th Edition):

Djang, Kevin. “An alternative architecture for performing basic computer arithmetical operations.” 2000. Masters Thesis, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/33066.

MLA Handbook (7th Edition):

Djang, Kevin. “An alternative architecture for performing basic computer arithmetical operations.” 2000. Web. 15 Apr 2021.

Vancouver:

Djang K. An alternative architecture for performing basic computer arithmetical operations. [Internet] [Masters thesis]. Oregon State University; 2000. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/33066.

Council of Science Editors:

Djang K. An alternative architecture for performing basic computer arithmetical operations. [Masters Thesis]. Oregon State University; 2000. Available from: http://hdl.handle.net/1957/33066


Oregon State University

13. Cavener, Jeffrey Douglas. Visualization, implementation, and application of the Walking Tree heuristics for biological string matching.

Degree: MS, Computer Science, 1997, Oregon State University

 Biologists need tools to see the structural relationships encoded in biological sequences (strings). The Walking Tree heuristics calculate some of these relationships. I have designed… (more)

Subjects/Keywords: Genetics  – Data processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cavener, J. D. (1997). Visualization, implementation, and application of the Walking Tree heuristics for biological string matching. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/33688

Chicago Manual of Style (16th Edition):

Cavener, Jeffrey Douglas. “Visualization, implementation, and application of the Walking Tree heuristics for biological string matching.” 1997. Masters Thesis, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/33688.

MLA Handbook (7th Edition):

Cavener, Jeffrey Douglas. “Visualization, implementation, and application of the Walking Tree heuristics for biological string matching.” 1997. Web. 15 Apr 2021.

Vancouver:

Cavener JD. Visualization, implementation, and application of the Walking Tree heuristics for biological string matching. [Internet] [Masters thesis]. Oregon State University; 1997. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/33688.

Council of Science Editors:

Cavener JD. Visualization, implementation, and application of the Walking Tree heuristics for biological string matching. [Masters Thesis]. Oregon State University; 1997. Available from: http://hdl.handle.net/1957/33688


Oregon State University

14. Palmer, Paul A. Drawing graphs nicely.

Degree: MS, Computer Science, 1995, Oregon State University

 A graph may he drawn in many different ways. We investigate how to draw a graph nicely, in the sense of being visually pleasing. We… (more)

Subjects/Keywords: Graphic methods  – Computer programs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Palmer, P. A. (1995). Drawing graphs nicely. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/34200

Chicago Manual of Style (16th Edition):

Palmer, Paul A. “Drawing graphs nicely.” 1995. Masters Thesis, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/34200.

MLA Handbook (7th Edition):

Palmer, Paul A. “Drawing graphs nicely.” 1995. Web. 15 Apr 2021.

Vancouver:

Palmer PA. Drawing graphs nicely. [Internet] [Masters thesis]. Oregon State University; 1995. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/34200.

Council of Science Editors:

Palmer PA. Drawing graphs nicely. [Masters Thesis]. Oregon State University; 1995. Available from: http://hdl.handle.net/1957/34200


Oregon State University

15. Larson, Shawn M. A linear equation model for a family of interconnection networks.

Degree: PhD, Computer Science, 1995, Oregon State University

 The most important part of parallel computation is communication. Except in the most embarassingly parallel examples, processors cannot work cooperatively to solve a problem unless… (more)

Subjects/Keywords: Hypercube networks (Computer networks)  – Mathematical models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Larson, S. M. (1995). A linear equation model for a family of interconnection networks. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/35141

Chicago Manual of Style (16th Edition):

Larson, Shawn M. “A linear equation model for a family of interconnection networks.” 1995. Doctoral Dissertation, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/35141.

MLA Handbook (7th Edition):

Larson, Shawn M. “A linear equation model for a family of interconnection networks.” 1995. Web. 15 Apr 2021.

Vancouver:

Larson SM. A linear equation model for a family of interconnection networks. [Internet] [Doctoral dissertation]. Oregon State University; 1995. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/35141.

Council of Science Editors:

Larson SM. A linear equation model for a family of interconnection networks. [Doctoral Dissertation]. Oregon State University; 1995. Available from: http://hdl.handle.net/1957/35141


Oregon State University

16. Hangartner, Ricky Dale. Probabilistic computation in stochastic pulse neuromime networks.

Degree: PhD, Computer Science, 1994, Oregon State University

Subjects/Keywords: Neural networks (Computer science)  – Mathematical models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hangartner, R. D. (1994). Probabilistic computation in stochastic pulse neuromime networks. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/35530

Chicago Manual of Style (16th Edition):

Hangartner, Ricky Dale. “Probabilistic computation in stochastic pulse neuromime networks.” 1994. Doctoral Dissertation, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/35530.

MLA Handbook (7th Edition):

Hangartner, Ricky Dale. “Probabilistic computation in stochastic pulse neuromime networks.” 1994. Web. 15 Apr 2021.

Vancouver:

Hangartner RD. Probabilistic computation in stochastic pulse neuromime networks. [Internet] [Doctoral dissertation]. Oregon State University; 1994. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/35530.

Council of Science Editors:

Hangartner RD. Probabilistic computation in stochastic pulse neuromime networks. [Doctoral Dissertation]. Oregon State University; 1994. Available from: http://hdl.handle.net/1957/35530


Oregon State University

17. Gunnels, John A. A comparison of simulated annealing and genetic algorithms for the genome mapping problems.

Degree: MS, Computer Science, 1993, Oregon State University

 The data used for the construction of genome maps is imperfect, therefore the mapping of a physically linear structure must take place in a very… (more)

Subjects/Keywords: Simulated annealing (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gunnels, J. A. (1993). A comparison of simulated annealing and genetic algorithms for the genome mapping problems. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/36599

Chicago Manual of Style (16th Edition):

Gunnels, John A. “A comparison of simulated annealing and genetic algorithms for the genome mapping problems.” 1993. Masters Thesis, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/36599.

MLA Handbook (7th Edition):

Gunnels, John A. “A comparison of simulated annealing and genetic algorithms for the genome mapping problems.” 1993. Web. 15 Apr 2021.

Vancouver:

Gunnels JA. A comparison of simulated annealing and genetic algorithms for the genome mapping problems. [Internet] [Masters thesis]. Oregon State University; 1993. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/36599.

Council of Science Editors:

Gunnels JA. A comparison of simulated annealing and genetic algorithms for the genome mapping problems. [Masters Thesis]. Oregon State University; 1993. Available from: http://hdl.handle.net/1957/36599


Oregon State University

18. Larson, Shawn M. The "Mobius Cube" : an interconnection network for parallel computation.

Degree: MS, Computer Science, 1990, Oregon State University

Subjects/Keywords: Computer networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Larson, S. M. (1990). The "Mobius Cube" : an interconnection network for parallel computation. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/38008

Chicago Manual of Style (16th Edition):

Larson, Shawn M. “The "Mobius Cube" : an interconnection network for parallel computation.” 1990. Masters Thesis, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/38008.

MLA Handbook (7th Edition):

Larson, Shawn M. “The "Mobius Cube" : an interconnection network for parallel computation.” 1990. Web. 15 Apr 2021.

Vancouver:

Larson SM. The "Mobius Cube" : an interconnection network for parallel computation. [Internet] [Masters thesis]. Oregon State University; 1990. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/38008.

Council of Science Editors:

Larson SM. The "Mobius Cube" : an interconnection network for parallel computation. [Masters Thesis]. Oregon State University; 1990. Available from: http://hdl.handle.net/1957/38008


Oregon State University

19. Obi, Gabriel Michael. Computers and planning : a study of the computer simulation methodology for land use planning in Bendel State, Nigeria.

Degree: MS, Computer Science, 1978, Oregon State University

 In this work we propose a computer based approach by means of which the decision maker in Bendel State, Nigeria, can best be assisted in… (more)

Subjects/Keywords: Land use  – Planning  – Nigeria  – Bendel State

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Obi, G. M. (1978). Computers and planning : a study of the computer simulation methodology for land use planning in Bendel State, Nigeria. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/42602

Chicago Manual of Style (16th Edition):

Obi, Gabriel Michael. “Computers and planning : a study of the computer simulation methodology for land use planning in Bendel State, Nigeria.” 1978. Masters Thesis, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/42602.

MLA Handbook (7th Edition):

Obi, Gabriel Michael. “Computers and planning : a study of the computer simulation methodology for land use planning in Bendel State, Nigeria.” 1978. Web. 15 Apr 2021.

Vancouver:

Obi GM. Computers and planning : a study of the computer simulation methodology for land use planning in Bendel State, Nigeria. [Internet] [Masters thesis]. Oregon State University; 1978. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/42602.

Council of Science Editors:

Obi GM. Computers and planning : a study of the computer simulation methodology for land use planning in Bendel State, Nigeria. [Masters Thesis]. Oregon State University; 1978. Available from: http://hdl.handle.net/1957/42602


Oregon State University

20. Oprisan, Paul. Error control techniques for the Z-channel.

Degree: PhD, Electrical and Computer Engineering, 2004, Oregon State University

 The asymmetric nature of bit errors in several practical applications provides grounds for efficient error control techniques. The Z-channel model and special classes of codes… (more)

Subjects/Keywords: Error-correcting codes (Information theory)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Oprisan, P. (2004). Error control techniques for the Z-channel. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/22319

Chicago Manual of Style (16th Edition):

Oprisan, Paul. “Error control techniques for the Z-channel.” 2004. Doctoral Dissertation, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/22319.

MLA Handbook (7th Edition):

Oprisan, Paul. “Error control techniques for the Z-channel.” 2004. Web. 15 Apr 2021.

Vancouver:

Oprisan P. Error control techniques for the Z-channel. [Internet] [Doctoral dissertation]. Oregon State University; 2004. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/22319.

Council of Science Editors:

Oprisan P. Error control techniques for the Z-channel. [Doctoral Dissertation]. Oregon State University; 2004. Available from: http://hdl.handle.net/1957/22319


Oregon State University

21. Amoth, Thomas R. Exact learning of tree patterns.

Degree: PhD, Computer Science, 2001, Oregon State University

 Tree patterns are natural candidates for representing rules and hypotheses in many tasks such as information extraction and symbolic mathematics. A tree pattern is a… (more)

Subjects/Keywords: Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Amoth, T. R. (2001). Exact learning of tree patterns. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/11820

Chicago Manual of Style (16th Edition):

Amoth, Thomas R. “Exact learning of tree patterns.” 2001. Doctoral Dissertation, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/11820.

MLA Handbook (7th Edition):

Amoth, Thomas R. “Exact learning of tree patterns.” 2001. Web. 15 Apr 2021.

Vancouver:

Amoth TR. Exact learning of tree patterns. [Internet] [Doctoral dissertation]. Oregon State University; 2001. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/11820.

Council of Science Editors:

Amoth TR. Exact learning of tree patterns. [Doctoral Dissertation]. Oregon State University; 2001. Available from: http://hdl.handle.net/1957/11820


Oregon State University

22. Elmougy, Samir. Some contributions to asymmetric error control codes.

Degree: PhD, Computer Science, 2005, Oregon State University

 In some practical systems, most of the errors are of 1 → 0 type and 0 → 1 errors occur very rarely. In this thesis,… (more)

Subjects/Keywords: Error-correcting codes (Information theory)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Elmougy, S. (2005). Some contributions to asymmetric error control codes. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/28888

Chicago Manual of Style (16th Edition):

Elmougy, Samir. “Some contributions to asymmetric error control codes.” 2005. Doctoral Dissertation, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/28888.

MLA Handbook (7th Edition):

Elmougy, Samir. “Some contributions to asymmetric error control codes.” 2005. Web. 15 Apr 2021.

Vancouver:

Elmougy S. Some contributions to asymmetric error control codes. [Internet] [Doctoral dissertation]. Oregon State University; 2005. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/28888.

Council of Science Editors:

Elmougy S. Some contributions to asymmetric error control codes. [Doctoral Dissertation]. Oregon State University; 2005. Available from: http://hdl.handle.net/1957/28888


Oregon State University

23. Seri, Sandeep. Hierarchical average reward reinforcement learning.

Degree: MS, Computer Science, 2002, Oregon State University

 Reinforcement Learning (RL) is the study of agents that learn optimal behavior by interacting with and receiving rewards and punishments from an unknown environment. RL… (more)

Subjects/Keywords: Reinforcement learning (Machine learning)  – Mathematical models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Seri, S. (2002). Hierarchical average reward reinforcement learning. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/31126

Chicago Manual of Style (16th Edition):

Seri, Sandeep. “Hierarchical average reward reinforcement learning.” 2002. Masters Thesis, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/31126.

MLA Handbook (7th Edition):

Seri, Sandeep. “Hierarchical average reward reinforcement learning.” 2002. Web. 15 Apr 2021.

Vancouver:

Seri S. Hierarchical average reward reinforcement learning. [Internet] [Masters thesis]. Oregon State University; 2002. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/31126.

Council of Science Editors:

Seri S. Hierarchical average reward reinforcement learning. [Masters Thesis]. Oregon State University; 2002. Available from: http://hdl.handle.net/1957/31126


Oregon State University

24. Li, ChyiShiun. Radiation effects in III-V compound semiconductor heterostructure devices.

Degree: MS, Electrical and Computer Engineering, 2002, Oregon State University

 The radiation effects in III-V heterojunction devices are investigated in this thesis. Two types of heterojunction devices studied are InGaP/GaAs single heterojunction bipolar transistors (SHBTs)… (more)

Subjects/Keywords: Heterojunctions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, C. (2002). Radiation effects in III-V compound semiconductor heterostructure devices. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/31095

Chicago Manual of Style (16th Edition):

Li, ChyiShiun. “Radiation effects in III-V compound semiconductor heterostructure devices.” 2002. Masters Thesis, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/31095.

MLA Handbook (7th Edition):

Li, ChyiShiun. “Radiation effects in III-V compound semiconductor heterostructure devices.” 2002. Web. 15 Apr 2021.

Vancouver:

Li C. Radiation effects in III-V compound semiconductor heterostructure devices. [Internet] [Masters thesis]. Oregon State University; 2002. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/31095.

Council of Science Editors:

Li C. Radiation effects in III-V compound semiconductor heterostructure devices. [Masters Thesis]. Oregon State University; 2002. Available from: http://hdl.handle.net/1957/31095


Oregon State University

25. AlMohammad, Bader Fahed AlBedaiwi. On resource placements and fault-tolerant broadcasting in toroidal networks.

Degree: PhD, Computer Science, 1997, Oregon State University

 Parallel computers are classified into: Multiprocessors, and multicomputers. A multiprocessor system usually has a shared memory through which its processors can communicate. On the other… (more)

Subjects/Keywords: Parallel processing (Electronic computers)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

AlMohammad, B. F. A. (1997). On resource placements and fault-tolerant broadcasting in toroidal networks. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/33680

Chicago Manual of Style (16th Edition):

AlMohammad, Bader Fahed AlBedaiwi. “On resource placements and fault-tolerant broadcasting in toroidal networks.” 1997. Doctoral Dissertation, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/33680.

MLA Handbook (7th Edition):

AlMohammad, Bader Fahed AlBedaiwi. “On resource placements and fault-tolerant broadcasting in toroidal networks.” 1997. Web. 15 Apr 2021.

Vancouver:

AlMohammad BFA. On resource placements and fault-tolerant broadcasting in toroidal networks. [Internet] [Doctoral dissertation]. Oregon State University; 1997. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/33680.

Council of Science Editors:

AlMohammad BFA. On resource placements and fault-tolerant broadcasting in toroidal networks. [Doctoral Dissertation]. Oregon State University; 1997. Available from: http://hdl.handle.net/1957/33680


Oregon State University

26. Wilde, Doran K. A library for doing polyhedral operations.

Degree: MS, Computer Science, 1993, Oregon State University

 Polyhedra are geometric representations of linear systems of equations and inequalities. Since polyhedra are used to represent the iteration domains of nested loop programs, procedures… (more)

Subjects/Keywords: Compilers (Computer programs)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wilde, D. K. (1993). A library for doing polyhedral operations. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/37202

Chicago Manual of Style (16th Edition):

Wilde, Doran K. “A library for doing polyhedral operations.” 1993. Masters Thesis, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/37202.

MLA Handbook (7th Edition):

Wilde, Doran K. “A library for doing polyhedral operations.” 1993. Web. 15 Apr 2021.

Vancouver:

Wilde DK. A library for doing polyhedral operations. [Internet] [Masters thesis]. Oregon State University; 1993. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/37202.

Council of Science Editors:

Wilde DK. A library for doing polyhedral operations. [Masters Thesis]. Oregon State University; 1993. Available from: http://hdl.handle.net/1957/37202


Oregon State University

27. Rose, Robert W. Evolving character controllers for collision preparation.

Degree: MS, Electrical and Computer Engineering, 2006, Oregon State University

 Full dynamic control of physically simulated characters is the holy grail of video games and other interactive applications. Recent advances in the field have presented… (more)

Subjects/Keywords: physically simulated characters; Self-protective behavior  – Computer simulation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rose, R. W. (2006). Evolving character controllers for collision preparation. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/3114

Chicago Manual of Style (16th Edition):

Rose, Robert W. “Evolving character controllers for collision preparation.” 2006. Masters Thesis, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/3114.

MLA Handbook (7th Edition):

Rose, Robert W. “Evolving character controllers for collision preparation.” 2006. Web. 15 Apr 2021.

Vancouver:

Rose RW. Evolving character controllers for collision preparation. [Internet] [Masters thesis]. Oregon State University; 2006. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/3114.

Council of Science Editors:

Rose RW. Evolving character controllers for collision preparation. [Masters Thesis]. Oregon State University; 2006. Available from: http://hdl.handle.net/1957/3114


Oregon State University

28. Pandey, Rajeev K. LacEDAemon : a programming environment for the multiparadigm language leda.

Degree: PhD, Computer Science, 1998, Oregon State University

 Multiparadigm programming languages are a recent development in the realm of programming languages. A multiparadigm programming language allows the use of multiple, differing programming paradigms… (more)

Subjects/Keywords: Leda (Computer program language)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pandey, R. K. (1998). LacEDAemon : a programming environment for the multiparadigm language leda. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/11549

Chicago Manual of Style (16th Edition):

Pandey, Rajeev K. “LacEDAemon : a programming environment for the multiparadigm language leda.” 1998. Doctoral Dissertation, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/11549.

MLA Handbook (7th Edition):

Pandey, Rajeev K. “LacEDAemon : a programming environment for the multiparadigm language leda.” 1998. Web. 15 Apr 2021.

Vancouver:

Pandey RK. LacEDAemon : a programming environment for the multiparadigm language leda. [Internet] [Doctoral dissertation]. Oregon State University; 1998. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/11549.

Council of Science Editors:

Pandey RK. LacEDAemon : a programming environment for the multiparadigm language leda. [Doctoral Dissertation]. Oregon State University; 1998. Available from: http://hdl.handle.net/1957/11549


Oregon State University

29. Siriboon, Thit. Integrated local and global microprogram reduction.

Degree: PhD, Electrical and Computer Engineering, 1988, Oregon State University

 Compaction of a horizontal microprogram is an attempt to exploit fully the parallelism permitted by a given algorithm and data processing structure in order to… (more)

Subjects/Keywords: Microprogramming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Siriboon, T. (1988). Integrated local and global microprogram reduction. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/39934

Chicago Manual of Style (16th Edition):

Siriboon, Thit. “Integrated local and global microprogram reduction.” 1988. Doctoral Dissertation, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/39934.

MLA Handbook (7th Edition):

Siriboon, Thit. “Integrated local and global microprogram reduction.” 1988. Web. 15 Apr 2021.

Vancouver:

Siriboon T. Integrated local and global microprogram reduction. [Internet] [Doctoral dissertation]. Oregon State University; 1988. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/39934.

Council of Science Editors:

Siriboon T. Integrated local and global microprogram reduction. [Doctoral Dissertation]. Oregon State University; 1988. Available from: http://hdl.handle.net/1957/39934


Oregon State University

30. Dechow, Doug. Advanced separation of concerns and the compatibility of aspect-orientation.

Degree: PhD, Computer Science, 2005, Oregon State University

 The appropriate separation of concerns is a fundamental engineering principle. A concern, for software developers, is that which must be represented by code in a… (more)

Subjects/Keywords: Computer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dechow, D. (2005). Advanced separation of concerns and the compatibility of aspect-orientation. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/29757

Chicago Manual of Style (16th Edition):

Dechow, Doug. “Advanced separation of concerns and the compatibility of aspect-orientation.” 2005. Doctoral Dissertation, Oregon State University. Accessed April 15, 2021. http://hdl.handle.net/1957/29757.

MLA Handbook (7th Edition):

Dechow, Doug. “Advanced separation of concerns and the compatibility of aspect-orientation.” 2005. Web. 15 Apr 2021.

Vancouver:

Dechow D. Advanced separation of concerns and the compatibility of aspect-orientation. [Internet] [Doctoral dissertation]. Oregon State University; 2005. [cited 2021 Apr 15]. Available from: http://hdl.handle.net/1957/29757.

Council of Science Editors:

Dechow D. Advanced separation of concerns and the compatibility of aspect-orientation. [Doctoral Dissertation]. Oregon State University; 2005. Available from: http://hdl.handle.net/1957/29757

[1] [2]

.