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:"Mississippi State University" +contributor:("Eric A. Hansen"). Showing records 1 – 13 of 13 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Mississippi State University

1. Wu, Xiaojian. A HEURISTIC SEARCH ALGORITHM FOR LEARNING OPTIMAL BAYESIAN NETWORKS.

Degree: MS, Computer Science and Engineering, 2010, Mississippi State University

  Bayesian network is a popular machine learning tool for modeling uncertain dependence relationships among the random factors of a domain. It represents the relations… (more)

Subjects/Keywords: Dynamic Programming; Heursitic Search; Structure Learning; Directed Acyclic Graph; Bayesian Network

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wu, X. (2010). A HEURISTIC SEARCH ALGORITHM FOR LEARNING OPTIMAL BAYESIAN NETWORKS. (Masters Thesis). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-07062010-111714/ ;

Chicago Manual of Style (16th Edition):

Wu, Xiaojian. “A HEURISTIC SEARCH ALGORITHM FOR LEARNING OPTIMAL BAYESIAN NETWORKS.” 2010. Masters Thesis, Mississippi State University. Accessed November 18, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-07062010-111714/ ;.

MLA Handbook (7th Edition):

Wu, Xiaojian. “A HEURISTIC SEARCH ALGORITHM FOR LEARNING OPTIMAL BAYESIAN NETWORKS.” 2010. Web. 18 Nov 2019.

Vancouver:

Wu X. A HEURISTIC SEARCH ALGORITHM FOR LEARNING OPTIMAL BAYESIAN NETWORKS. [Internet] [Masters thesis]. Mississippi State University; 2010. [cited 2019 Nov 18]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-07062010-111714/ ;.

Council of Science Editors:

Wu X. A HEURISTIC SEARCH ALGORITHM FOR LEARNING OPTIMAL BAYESIAN NETWORKS. [Masters Thesis]. Mississippi State University; 2010. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-07062010-111714/ ;


Mississippi State University

2. Mahmoud, Anas M. TRAVEL TIME ESTIMATION IN CONGESTED URBAN NETWORKS USING POINT DETECTORS DATA.

Degree: MS, Computer Science and Engineering, 2009, Mississippi State University

 A model for estimating travel time on short arterial links of congested urban networks, using currently available technology, is introduced in this thesis. The objective… (more)

Subjects/Keywords: Travel time; Congested Networks; Computer science; Artificial Intelligence; Intelligent Transportation systems; Neural Networks; point detectors; Multiple linear regression; Matlab; Estimation; K nearest neighbors; congestions; data cleaning; traffic detectors; emergency evacuation; GPS

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mahmoud, A. M. (2009). TRAVEL TIME ESTIMATION IN CONGESTED URBAN NETWORKS USING POINT DETECTORS DATA. (Masters Thesis). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-04022009-163043/ ;

Chicago Manual of Style (16th Edition):

Mahmoud, Anas M. “TRAVEL TIME ESTIMATION IN CONGESTED URBAN NETWORKS USING POINT DETECTORS DATA.” 2009. Masters Thesis, Mississippi State University. Accessed November 18, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-04022009-163043/ ;.

MLA Handbook (7th Edition):

Mahmoud, Anas M. “TRAVEL TIME ESTIMATION IN CONGESTED URBAN NETWORKS USING POINT DETECTORS DATA.” 2009. Web. 18 Nov 2019.

Vancouver:

Mahmoud AM. TRAVEL TIME ESTIMATION IN CONGESTED URBAN NETWORKS USING POINT DETECTORS DATA. [Internet] [Masters thesis]. Mississippi State University; 2009. [cited 2019 Nov 18]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-04022009-163043/ ;.

Council of Science Editors:

Mahmoud AM. TRAVEL TIME ESTIMATION IN CONGESTED URBAN NETWORKS USING POINT DETECTORS DATA. [Masters Thesis]. Mississippi State University; 2009. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-04022009-163043/ ;


Mississippi State University

3. Zhang, Yang. THE APPLICATION OF THE KEY-VALUE-REFERENCE MODEL IN DYNAMIC IRREGULAR PARALLEL COMPUTATION.

Degree: PhD, Computer Science and Engineering, 2009, Mississippi State University

 This dissertation studies the effects of the "key-value-ref" model in the computational field simulation software development process. The motivation of this study is rooted in… (more)

Subjects/Keywords: parallel programming; software composition; resource management; numerical simulation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, Y. (2009). THE APPLICATION OF THE KEY-VALUE-REFERENCE MODEL IN DYNAMIC IRREGULAR PARALLEL COMPUTATION. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-04032009-160012/ ;

Chicago Manual of Style (16th Edition):

Zhang, Yang. “THE APPLICATION OF THE KEY-VALUE-REFERENCE MODEL IN DYNAMIC IRREGULAR PARALLEL COMPUTATION.” 2009. Doctoral Dissertation, Mississippi State University. Accessed November 18, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-04032009-160012/ ;.

MLA Handbook (7th Edition):

Zhang, Yang. “THE APPLICATION OF THE KEY-VALUE-REFERENCE MODEL IN DYNAMIC IRREGULAR PARALLEL COMPUTATION.” 2009. Web. 18 Nov 2019.

Vancouver:

Zhang Y. THE APPLICATION OF THE KEY-VALUE-REFERENCE MODEL IN DYNAMIC IRREGULAR PARALLEL COMPUTATION. [Internet] [Doctoral dissertation]. Mississippi State University; 2009. [cited 2019 Nov 18]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-04032009-160012/ ;.

Council of Science Editors:

Zhang Y. THE APPLICATION OF THE KEY-VALUE-REFERENCE MODEL IN DYNAMIC IRREGULAR PARALLEL COMPUTATION. [Doctoral Dissertation]. Mississippi State University; 2009. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-04032009-160012/ ;


Mississippi State University

4. Parihar, Naveen. PARALLEL VITERBI SEARCH FOR CONTINUOUS SPEECH RECOGNITION ON A MULTI-CORE ARCHITECTURE.

Degree: PhD, Electrical and Computer Engineering, 2009, Mississippi State University

State-of-the-art speech-recognition systems can successfully perform simple tasks in real-time on most computers, when the tasks are performed in controlled and noise-free environments. However,… (more)

Subjects/Keywords: fast gaussian calculations; fast likelihood computations; prefix tree; lexical tree; parallel speech decoding; parallel speech recognition; multi-core processors

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Parihar, N. (2009). PARALLEL VITERBI SEARCH FOR CONTINUOUS SPEECH RECOGNITION ON A MULTI-CORE ARCHITECTURE. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-11042009-134125/ ;

Chicago Manual of Style (16th Edition):

Parihar, Naveen. “PARALLEL VITERBI SEARCH FOR CONTINUOUS SPEECH RECOGNITION ON A MULTI-CORE ARCHITECTURE.” 2009. Doctoral Dissertation, Mississippi State University. Accessed November 18, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-11042009-134125/ ;.

MLA Handbook (7th Edition):

Parihar, Naveen. “PARALLEL VITERBI SEARCH FOR CONTINUOUS SPEECH RECOGNITION ON A MULTI-CORE ARCHITECTURE.” 2009. Web. 18 Nov 2019.

Vancouver:

Parihar N. PARALLEL VITERBI SEARCH FOR CONTINUOUS SPEECH RECOGNITION ON A MULTI-CORE ARCHITECTURE. [Internet] [Doctoral dissertation]. Mississippi State University; 2009. [cited 2019 Nov 18]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-11042009-134125/ ;.

Council of Science Editors:

Parihar N. PARALLEL VITERBI SEARCH FOR CONTINUOUS SPEECH RECOGNITION ON A MULTI-CORE ARCHITECTURE. [Doctoral Dissertation]. Mississippi State University; 2009. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-11042009-134125/ ;


Mississippi State University

5. Sanders, William Shane. MACHINE LEARNING AND MAPPING ALGORITHMS APPLIED TO PROTEOMICS PROBLEMS.

Degree: PhD, Biochemistry and Molecular Biology, 2011, Mississippi State University

  Proteins provide evidence that a given gene is expressed, and machine learning algorithms can be applied to various proteomics problems in order to gain… (more)

Subjects/Keywords: machine learning; proteomics; mapping algorithms; cell penetrating peptides; peptide observability; proteogenomic mapping; chicken

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sanders, W. S. (2011). MACHINE LEARNING AND MAPPING ALGORITHMS APPLIED TO PROTEOMICS PROBLEMS. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-03302011-142931/ ;

Chicago Manual of Style (16th Edition):

Sanders, William Shane. “MACHINE LEARNING AND MAPPING ALGORITHMS APPLIED TO PROTEOMICS PROBLEMS.” 2011. Doctoral Dissertation, Mississippi State University. Accessed November 18, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-03302011-142931/ ;.

MLA Handbook (7th Edition):

Sanders, William Shane. “MACHINE LEARNING AND MAPPING ALGORITHMS APPLIED TO PROTEOMICS PROBLEMS.” 2011. Web. 18 Nov 2019.

Vancouver:

Sanders WS. MACHINE LEARNING AND MAPPING ALGORITHMS APPLIED TO PROTEOMICS PROBLEMS. [Internet] [Doctoral dissertation]. Mississippi State University; 2011. [cited 2019 Nov 18]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-03302011-142931/ ;.

Council of Science Editors:

Sanders WS. MACHINE LEARNING AND MAPPING ALGORITHMS APPLIED TO PROTEOMICS PROBLEMS. [Doctoral Dissertation]. Mississippi State University; 2011. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-03302011-142931/ ;

6. Mahmoud, Anas. Toward an effective automated tracing process.

Degree: PhD, Computer Science and Engineering, 2014, Mississippi State University

  Traceability is defined as the ability to establish, record, and maintain dependency relations among various software artifacts in a software system, in both a… (more)

Subjects/Keywords: information foraging; refactoring; clustering; semantics; indexing; information retrieval; traceability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mahmoud, A. (2014). Toward an effective automated tracing process. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-04212014-203030/ ;

Chicago Manual of Style (16th Edition):

Mahmoud, Anas. “Toward an effective automated tracing process.” 2014. Doctoral Dissertation, Mississippi State University. Accessed November 18, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-04212014-203030/ ;.

MLA Handbook (7th Edition):

Mahmoud, Anas. “Toward an effective automated tracing process.” 2014. Web. 18 Nov 2019.

Vancouver:

Mahmoud A. Toward an effective automated tracing process. [Internet] [Doctoral dissertation]. Mississippi State University; 2014. [cited 2019 Nov 18]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-04212014-203030/ ;.

Council of Science Editors:

Mahmoud A. Toward an effective automated tracing process. [Doctoral Dissertation]. Mississippi State University; 2014. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-04212014-203030/ ;


Mississippi State University

7. Marwah, Gaurav. ALGORITHMS FOR STOCHASTIC FINITE MEMORY CONTROL OF PARTIALLY OBSERVABLE SYSTEMS.

Degree: MS, Computer Science, 2005, Mississippi State University

 A partially observable Markov decision process (POMDP) is a mathematical framework for planning and control problems in which actions have stochastic effects and observations provide… (more)

Subjects/Keywords: POMDP

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Marwah, G. (2005). ALGORITHMS FOR STOCHASTIC FINITE MEMORY CONTROL OF PARTIALLY OBSERVABLE SYSTEMS. (Masters Thesis). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-07082005-132056/ ;

Chicago Manual of Style (16th Edition):

Marwah, Gaurav. “ALGORITHMS FOR STOCHASTIC FINITE MEMORY CONTROL OF PARTIALLY OBSERVABLE SYSTEMS.” 2005. Masters Thesis, Mississippi State University. Accessed November 18, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-07082005-132056/ ;.

MLA Handbook (7th Edition):

Marwah, Gaurav. “ALGORITHMS FOR STOCHASTIC FINITE MEMORY CONTROL OF PARTIALLY OBSERVABLE SYSTEMS.” 2005. Web. 18 Nov 2019.

Vancouver:

Marwah G. ALGORITHMS FOR STOCHASTIC FINITE MEMORY CONTROL OF PARTIALLY OBSERVABLE SYSTEMS. [Internet] [Masters thesis]. Mississippi State University; 2005. [cited 2019 Nov 18]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-07082005-132056/ ;.

Council of Science Editors:

Marwah G. ALGORITHMS FOR STOCHASTIC FINITE MEMORY CONTROL OF PARTIALLY OBSERVABLE SYSTEMS. [Masters Thesis]. Mississippi State University; 2005. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-07082005-132056/ ;


Mississippi State University

8. ABU OMAR, OSAMA YOUSEF. ARTIFICIAL NEURAL NETWORK MODELING OF FLOW STRESS RESPONSE AS A FUNCTION OF DISLOCATION MICROSTRUCTURES.

Degree: MS, Electrical and Computer Engineering, 2007, Mississippi State University

 An artificial neural network (ANN) is used to model nonlinear, large deformation plastic behavior of a material. This ANN model establishes a relationship between flow… (more)

Subjects/Keywords: Sensitivity Analysis; Bayesian Regularization; leave-one-out Cross Validation; Flow Stress; ANN; GND Density; Dislocation Cell Size; Dislocation Cell Wall Thickness; Dislocation Microstructures; Multiple Linear Regression

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

ABU OMAR, O. Y. (2007). ARTIFICIAL NEURAL NETWORK MODELING OF FLOW STRESS RESPONSE AS A FUNCTION OF DISLOCATION MICROSTRUCTURES. (Masters Thesis). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-06222007-112519/ ;

Chicago Manual of Style (16th Edition):

ABU OMAR, OSAMA YOUSEF. “ARTIFICIAL NEURAL NETWORK MODELING OF FLOW STRESS RESPONSE AS A FUNCTION OF DISLOCATION MICROSTRUCTURES.” 2007. Masters Thesis, Mississippi State University. Accessed November 18, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-06222007-112519/ ;.

MLA Handbook (7th Edition):

ABU OMAR, OSAMA YOUSEF. “ARTIFICIAL NEURAL NETWORK MODELING OF FLOW STRESS RESPONSE AS A FUNCTION OF DISLOCATION MICROSTRUCTURES.” 2007. Web. 18 Nov 2019.

Vancouver:

ABU OMAR OY. ARTIFICIAL NEURAL NETWORK MODELING OF FLOW STRESS RESPONSE AS A FUNCTION OF DISLOCATION MICROSTRUCTURES. [Internet] [Masters thesis]. Mississippi State University; 2007. [cited 2019 Nov 18]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-06222007-112519/ ;.

Council of Science Editors:

ABU OMAR OY. ARTIFICIAL NEURAL NETWORK MODELING OF FLOW STRESS RESPONSE AS A FUNCTION OF DISLOCATION MICROSTRUCTURES. [Masters Thesis]. Mississippi State University; 2007. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-06222007-112519/ ;


Mississippi State University

9. Neppalli, Srinivas. DESIGN, CONSTRUCTION, INVERSE KINEMATICS, AND VISUALIZATION OF CONTINUUM ROBOTS.

Degree: MS, Electrical and Computer Engineering, 2008, Mississippi State University

 Continuum robots are the biologically inspired robots that mimic the behaviors of mammalian tongues, elephant trunks, and octopus arms. These robots feature a backboneless structure… (more)

Subjects/Keywords: Biologically inspired robots; Continuum manipulators; Inverse kinematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Neppalli, S. (2008). DESIGN, CONSTRUCTION, INVERSE KINEMATICS, AND VISUALIZATION OF CONTINUUM ROBOTS. (Masters Thesis). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-10312008-144310/ ;

Chicago Manual of Style (16th Edition):

Neppalli, Srinivas. “DESIGN, CONSTRUCTION, INVERSE KINEMATICS, AND VISUALIZATION OF CONTINUUM ROBOTS.” 2008. Masters Thesis, Mississippi State University. Accessed November 18, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-10312008-144310/ ;.

MLA Handbook (7th Edition):

Neppalli, Srinivas. “DESIGN, CONSTRUCTION, INVERSE KINEMATICS, AND VISUALIZATION OF CONTINUUM ROBOTS.” 2008. Web. 18 Nov 2019.

Vancouver:

Neppalli S. DESIGN, CONSTRUCTION, INVERSE KINEMATICS, AND VISUALIZATION OF CONTINUUM ROBOTS. [Internet] [Masters thesis]. Mississippi State University; 2008. [cited 2019 Nov 18]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10312008-144310/ ;.

Council of Science Editors:

Neppalli S. DESIGN, CONSTRUCTION, INVERSE KINEMATICS, AND VISUALIZATION OF CONTINUUM ROBOTS. [Masters Thesis]. Mississippi State University; 2008. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10312008-144310/ ;


Mississippi State University

10. Liu, Zhen. COMBINING STATIC ANALYSIS AND DYNAMIC LEARNING TO BUILD CONTEXT SENSITIVE MODELS OF PROGRAM BEHAVIOR.

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

 Two methods are used to acquire models of program behavior for anomaly detection: static analysis of program code or dynamic learning from audit data. Model… (more)

Subjects/Keywords: Intrusion detection; anomaly detection; computer security; information assurance; automata model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, Z. (2005). COMBINING STATIC ANALYSIS AND DYNAMIC LEARNING TO BUILD CONTEXT SENSITIVE MODELS OF PROGRAM BEHAVIOR. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-11102005-043143/ ;

Chicago Manual of Style (16th Edition):

Liu, Zhen. “COMBINING STATIC ANALYSIS AND DYNAMIC LEARNING TO BUILD CONTEXT SENSITIVE MODELS OF PROGRAM BEHAVIOR.” 2005. Doctoral Dissertation, Mississippi State University. Accessed November 18, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-11102005-043143/ ;.

MLA Handbook (7th Edition):

Liu, Zhen. “COMBINING STATIC ANALYSIS AND DYNAMIC LEARNING TO BUILD CONTEXT SENSITIVE MODELS OF PROGRAM BEHAVIOR.” 2005. Web. 18 Nov 2019.

Vancouver:

Liu Z. COMBINING STATIC ANALYSIS AND DYNAMIC LEARNING TO BUILD CONTEXT SENSITIVE MODELS OF PROGRAM BEHAVIOR. [Internet] [Doctoral dissertation]. Mississippi State University; 2005. [cited 2019 Nov 18]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-11102005-043143/ ;.

Council of Science Editors:

Liu Z. COMBINING STATIC ANALYSIS AND DYNAMIC LEARNING TO BUILD CONTEXT SENSITIVE MODELS OF PROGRAM BEHAVIOR. [Doctoral Dissertation]. Mississippi State University; 2005. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-11102005-043143/ ;


Mississippi State University

11. Hossain, Mahmood. CLUSTERING MULTIPLE CONTEXTUALLY RELATED HETEROGENEOUS DATASETS.

Degree: PhD, Accountancy, School of, 2006, Mississippi State University

 Traditional clustering is typically based on a single feature set. In some domains, several feature sets may be available to represent the same objects, but… (more)

Subjects/Keywords: Ensemble Clustering; Heterogeneous Datasets; Graph Theoretic Clustering; Mutual Entropy

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hossain, M. (2006). CLUSTERING MULTIPLE CONTEXTUALLY RELATED HETEROGENEOUS DATASETS. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-11052006-223424/ ;

Chicago Manual of Style (16th Edition):

Hossain, Mahmood. “CLUSTERING MULTIPLE CONTEXTUALLY RELATED HETEROGENEOUS DATASETS.” 2006. Doctoral Dissertation, Mississippi State University. Accessed November 18, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-11052006-223424/ ;.

MLA Handbook (7th Edition):

Hossain, Mahmood. “CLUSTERING MULTIPLE CONTEXTUALLY RELATED HETEROGENEOUS DATASETS.” 2006. Web. 18 Nov 2019.

Vancouver:

Hossain M. CLUSTERING MULTIPLE CONTEXTUALLY RELATED HETEROGENEOUS DATASETS. [Internet] [Doctoral dissertation]. Mississippi State University; 2006. [cited 2019 Nov 18]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-11052006-223424/ ;.

Council of Science Editors:

Hossain M. CLUSTERING MULTIPLE CONTEXTUALLY RELATED HETEROGENEOUS DATASETS. [Doctoral Dissertation]. Mississippi State University; 2006. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-11052006-223424/ ;


Mississippi State University

12. Dandass, Yoginder Singh. Generalizing List Scheduling for Stochastic Soft Real-Time Parallel Applications.

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

 Advanced architecture processors provide features such as caches and branch prediction that result in improved, but variable, execution time of software. Hard real-time systems require… (more)

Subjects/Keywords: list scheduling; probability distribution; directed acyclic graph; stochastic; real-time; genetic list scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dandass, Y. S. (2003). Generalizing List Scheduling for Stochastic Soft Real-Time Parallel Applications. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-10302003-145944/ ;

Chicago Manual of Style (16th Edition):

Dandass, Yoginder Singh. “Generalizing List Scheduling for Stochastic Soft Real-Time Parallel Applications.” 2003. Doctoral Dissertation, Mississippi State University. Accessed November 18, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-10302003-145944/ ;.

MLA Handbook (7th Edition):

Dandass, Yoginder Singh. “Generalizing List Scheduling for Stochastic Soft Real-Time Parallel Applications.” 2003. Web. 18 Nov 2019.

Vancouver:

Dandass YS. Generalizing List Scheduling for Stochastic Soft Real-Time Parallel Applications. [Internet] [Doctoral dissertation]. Mississippi State University; 2003. [cited 2019 Nov 18]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10302003-145944/ ;.

Council of Science Editors:

Dandass YS. Generalizing List Scheduling for Stochastic Soft Real-Time Parallel Applications. [Doctoral Dissertation]. Mississippi State University; 2003. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10302003-145944/ ;


Mississippi State University

13. Zhou, Rong. Memory-Efficient Graph Search Applied to Multiple Sequence Alignment.

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

 Graph search is used in many areas of computer science. It is well-known that the scalability of graph-search algorithms such as A* is limited by… (more)

Subjects/Keywords: heuristic search; external-memory graph search; memory-based heuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhou, R. (2005). Memory-Efficient Graph Search Applied to Multiple Sequence Alignment. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-06282005-015428/ ;

Chicago Manual of Style (16th Edition):

Zhou, Rong. “Memory-Efficient Graph Search Applied to Multiple Sequence Alignment.” 2005. Doctoral Dissertation, Mississippi State University. Accessed November 18, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-06282005-015428/ ;.

MLA Handbook (7th Edition):

Zhou, Rong. “Memory-Efficient Graph Search Applied to Multiple Sequence Alignment.” 2005. Web. 18 Nov 2019.

Vancouver:

Zhou R. Memory-Efficient Graph Search Applied to Multiple Sequence Alignment. [Internet] [Doctoral dissertation]. Mississippi State University; 2005. [cited 2019 Nov 18]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-06282005-015428/ ;.

Council of Science Editors:

Zhou R. Memory-Efficient Graph Search Applied to Multiple Sequence Alignment. [Doctoral Dissertation]. Mississippi State University; 2005. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-06282005-015428/ ;

.