Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(search space analysis). 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. 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


University of New South Wales

2. Sallam, Karam. A Study of Function Landscape and Search Space with Evolutionary Algorithms.

Degree: Engineering & Information Technology, 2018, University of New South Wales

 Optimization techniques are used extensively to solve many real-world decision making problems which have different characteristics and mathematical properties that make the process of finding… (more)

Subjects/Keywords: differential evolution; Evolutionary algorithms; constrained optimization; landscape analysis; reduced search space

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sallam, K. (2018). A Study of Function Landscape and Search Space with Evolutionary Algorithms. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/59803 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:49835/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Sallam, Karam. “A Study of Function Landscape and Search Space with Evolutionary Algorithms.” 2018. Doctoral Dissertation, University of New South Wales. Accessed February 28, 2021. http://handle.unsw.edu.au/1959.4/59803 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:49835/SOURCE02?view=true.

MLA Handbook (7th Edition):

Sallam, Karam. “A Study of Function Landscape and Search Space with Evolutionary Algorithms.” 2018. Web. 28 Feb 2021.

Vancouver:

Sallam K. A Study of Function Landscape and Search Space with Evolutionary Algorithms. [Internet] [Doctoral dissertation]. University of New South Wales; 2018. [cited 2021 Feb 28]. Available from: http://handle.unsw.edu.au/1959.4/59803 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:49835/SOURCE02?view=true.

Council of Science Editors:

Sallam K. A Study of Function Landscape and Search Space with Evolutionary Algorithms. [Doctoral Dissertation]. University of New South Wales; 2018. Available from: http://handle.unsw.edu.au/1959.4/59803 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:49835/SOURCE02?view=true


Loughborough University

3. Warsop, Thomas E. Three-dimensional scene recovery for measuring sighting distances of rail track assets from monocular forward facing videos.

Degree: PhD, 2011, Loughborough University

 Rail track asset sighting distance must be checked regularly to ensure the continued and safe operation of rolling stock. Methods currently used to check asset… (more)

Subjects/Keywords: 502.85; Rail track asset sighting distance; Line-of-sight analysis; Monocular video; Three-dimensional scene recovery; Unsupervised learning; Feature search space reduction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Warsop, T. E. (2011). Three-dimensional scene recovery for measuring sighting distances of rail track assets from monocular forward facing videos. (Doctoral Dissertation). Loughborough University. Retrieved from http://hdl.handle.net/2134/8994

Chicago Manual of Style (16th Edition):

Warsop, Thomas E. “Three-dimensional scene recovery for measuring sighting distances of rail track assets from monocular forward facing videos.” 2011. Doctoral Dissertation, Loughborough University. Accessed February 28, 2021. http://hdl.handle.net/2134/8994.

MLA Handbook (7th Edition):

Warsop, Thomas E. “Three-dimensional scene recovery for measuring sighting distances of rail track assets from monocular forward facing videos.” 2011. Web. 28 Feb 2021.

Vancouver:

Warsop TE. Three-dimensional scene recovery for measuring sighting distances of rail track assets from monocular forward facing videos. [Internet] [Doctoral dissertation]. Loughborough University; 2011. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/2134/8994.

Council of Science Editors:

Warsop TE. Three-dimensional scene recovery for measuring sighting distances of rail track assets from monocular forward facing videos. [Doctoral Dissertation]. Loughborough University; 2011. Available from: http://hdl.handle.net/2134/8994


University of Texas – Austin

4. Radhakrishnan, Pradeep, 1984-. Automated design of planar mechanisms.

Degree: PhD, Mechanical Engineering, 2014, University of Texas – Austin

 The challenges in automating the design of planar mechanisms are tremendous especially in areas related to computational representation, kinematic analysis and synthesis of planar mechanisms.… (more)

Subjects/Keywords: Automated design of planar mechanisms; Mechanism synthesis; Kinematic analysis; Representation of mechanisms; Graph grammar representation; Optimization of mechanisms; Particle swarm optimization; Nelder-Mead; Search space characteristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Radhakrishnan, Pradeep, 1. (2014). Automated design of planar mechanisms. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/24806

Chicago Manual of Style (16th Edition):

Radhakrishnan, Pradeep, 1984-. “Automated design of planar mechanisms.” 2014. Doctoral Dissertation, University of Texas – Austin. Accessed February 28, 2021. http://hdl.handle.net/2152/24806.

MLA Handbook (7th Edition):

Radhakrishnan, Pradeep, 1984-. “Automated design of planar mechanisms.” 2014. Web. 28 Feb 2021.

Vancouver:

Radhakrishnan, Pradeep 1. Automated design of planar mechanisms. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2014. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/2152/24806.

Council of Science Editors:

Radhakrishnan, Pradeep 1. Automated design of planar mechanisms. [Doctoral Dissertation]. University of Texas – Austin; 2014. Available from: http://hdl.handle.net/2152/24806


Washington University in St. Louis

5. Harris, Steven. Investigating Single Precision Floating General Matrix Multiply in Heterogeneous Hardware.

Degree: MS, Computer Science & Engineering, 2020, Washington University in St. Louis

  The fundamental operation of matrix multiplication is ubiquitous across a myriad of disciplines. Yet, the identification of new optimizations for matrix multiplication remains relevant… (more)

Subjects/Keywords: Design space search; HARP; High-level synthesis; OpenCL; SGEMM; Field programmable gate array; heterogeneous architecture; Computer and Systems Architecture; Engineering; Hardware Systems; Numerical Analysis and Scientific Computing; Software Engineering; Systems Architecture; Theory and Algorithms; VLSI and Circuits, Embedded and Hardware Systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Harris, S. (2020). Investigating Single Precision Floating General Matrix Multiply in Heterogeneous Hardware. (Thesis). Washington University in St. Louis. Retrieved from https://openscholarship.wustl.edu/eng_etds/536

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

Chicago Manual of Style (16th Edition):

Harris, Steven. “Investigating Single Precision Floating General Matrix Multiply in Heterogeneous Hardware.” 2020. Thesis, Washington University in St. Louis. Accessed February 28, 2021. https://openscholarship.wustl.edu/eng_etds/536.

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

MLA Handbook (7th Edition):

Harris, Steven. “Investigating Single Precision Floating General Matrix Multiply in Heterogeneous Hardware.” 2020. Web. 28 Feb 2021.

Vancouver:

Harris S. Investigating Single Precision Floating General Matrix Multiply in Heterogeneous Hardware. [Internet] [Thesis]. Washington University in St. Louis; 2020. [cited 2021 Feb 28]. Available from: https://openscholarship.wustl.edu/eng_etds/536.

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

Council of Science Editors:

Harris S. Investigating Single Precision Floating General Matrix Multiply in Heterogeneous Hardware. [Thesis]. Washington University in St. Louis; 2020. Available from: https://openscholarship.wustl.edu/eng_etds/536

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


Université de Grenoble

6. Bensaid, Hicham. Utilisation des schématisations de termes en déduction automatique : Using term schematisations in automated deduction.

Degree: Docteur es, Informatique, 2011, Université de Grenoble

Les schématisations de termes permettent de représenter des ensembles infinis de termes ayant une structure similaire de manière finie et compacte. Dans ce travail, nous… (more)

Subjects/Keywords: Démonstration automatique de théorèmes; Démonstration automatique de théorèmes; I-termes; Analyse de l'espace de recherche; Complétude réfutationnelle; Indexation de termes; Automated theorem proving; Term schematization; I-termes; Search space analysis; Refutation completeness; Refutation completeness,term indexing; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bensaid, H. (2011). Utilisation des schématisations de termes en déduction automatique : Using term schematisations in automated deduction. (Doctoral Dissertation). Université de Grenoble. Retrieved from http://www.theses.fr/2011GRENM019

Chicago Manual of Style (16th Edition):

Bensaid, Hicham. “Utilisation des schématisations de termes en déduction automatique : Using term schematisations in automated deduction.” 2011. Doctoral Dissertation, Université de Grenoble. Accessed February 28, 2021. http://www.theses.fr/2011GRENM019.

MLA Handbook (7th Edition):

Bensaid, Hicham. “Utilisation des schématisations de termes en déduction automatique : Using term schematisations in automated deduction.” 2011. Web. 28 Feb 2021.

Vancouver:

Bensaid H. Utilisation des schématisations de termes en déduction automatique : Using term schematisations in automated deduction. [Internet] [Doctoral dissertation]. Université de Grenoble; 2011. [cited 2021 Feb 28]. Available from: http://www.theses.fr/2011GRENM019.

Council of Science Editors:

Bensaid H. Utilisation des schématisations de termes en déduction automatique : Using term schematisations in automated deduction. [Doctoral Dissertation]. Université de Grenoble; 2011. Available from: http://www.theses.fr/2011GRENM019


Brigham Young University

7. Self, Joel P. On-the-Fly Dynamic Dead Variable Analysis.

Degree: MS, 2007, Brigham Young University

 State explosion in model checking continues to be the primary obstacle to widespread use of software model checking. The large input ranges of variables used… (more)

Subjects/Keywords: model checking; computer science; static; static analysis; dynamic analysis; analysis; program; program analysis; Estes; GDB; dead variable analysis; dead variable; live variable; live variable analysis; CFG; abstraction; data abstraction; on-the-fly; static program analysis; control flow graph; software model checking; state space; depth first search; state explosion; state explosion problem; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Self, J. P. (2007). On-the-Fly Dynamic Dead Variable Analysis. (Masters Thesis). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=1885&context=etd

Chicago Manual of Style (16th Edition):

Self, Joel P. “On-the-Fly Dynamic Dead Variable Analysis.” 2007. Masters Thesis, Brigham Young University. Accessed February 28, 2021. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=1885&context=etd.

MLA Handbook (7th Edition):

Self, Joel P. “On-the-Fly Dynamic Dead Variable Analysis.” 2007. Web. 28 Feb 2021.

Vancouver:

Self JP. On-the-Fly Dynamic Dead Variable Analysis. [Internet] [Masters thesis]. Brigham Young University; 2007. [cited 2021 Feb 28]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=1885&context=etd.

Council of Science Editors:

Self JP. On-the-Fly Dynamic Dead Variable Analysis. [Masters Thesis]. Brigham Young University; 2007. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=1885&context=etd


University of Illinois – Chicago

8. Sha, Lingdao. Sparsity and Manifold Methods in Image and Higher Dimensional Data Representation.

Degree: 2018, University of Illinois – Chicago

 One of the most important concept underlines recent development of image and signal processing is sparsity. Specifically, most applications in getting signals/images of interest can… (more)

Subjects/Keywords: SC Sparse Coding DL Dictionary Learning MAC Morphological Component Analysis OGLR Optimal Graph Laplacian Regularizer SSC Simultaneous Sparse Coding GSM Gaussian Scale Mixture SSC-GSM Simultaneous Sparse Coding with GSM BM3D Block-matching and 3D Filtering PSNR Peak Signal-to-noise Ratio NMF Nonnegative Matrix Factorization LARS Least Angle Regression Kron Kronecker Kron-LARS Kronecker Least Angle Regression NBS-LARS N-dimensional Block Sparse Least Angle Regression OMP Orthogonal Matching Pursuit NBOMP N-dimensional Block Sparse OMP MP Matching Pursuit CS Compressed Sensing / Compressive Sensing IR Image Restoration TV Total Variation ICA Independent Component Analysis KSVD K Sigular Value Decomposition PCA Principle Component Analysis GNMF Graph Regularized NMF GraphSC Graph Regularized Sparse Coding MAP Maximum A Posteriori Estimation DGSC Dual Graph Regularized Sparse Coding FS-LD Feature-sign Search with Lagrange Dual LARS-BCD Least Angle Regression with Block Coordinate De- scent SVM Support Vector Machine NMI Normalized Mutual Information WT Wavelet Transform DCT Discrete Cosine Transform NSP Null Space Property RIP Restricted Isometry Property CT Computed Tomography MRI Magnetic Resonance Imaging HCI Hyperspectral Compressed Imaging LLE Locally Linear Embed LLESC Locally Linear Embedded Sparse Coding

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sha, L. (2018). Sparsity and Manifold Methods in Image and Higher Dimensional Data Representation. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/22945

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

Chicago Manual of Style (16th Edition):

Sha, Lingdao. “Sparsity and Manifold Methods in Image and Higher Dimensional Data Representation.” 2018. Thesis, University of Illinois – Chicago. Accessed February 28, 2021. http://hdl.handle.net/10027/22945.

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

MLA Handbook (7th Edition):

Sha, Lingdao. “Sparsity and Manifold Methods in Image and Higher Dimensional Data Representation.” 2018. Web. 28 Feb 2021.

Vancouver:

Sha L. Sparsity and Manifold Methods in Image and Higher Dimensional Data Representation. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/10027/22945.

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

Council of Science Editors:

Sha L. Sparsity and Manifold Methods in Image and Higher Dimensional Data Representation. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/22945

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

.