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:(algorithm approximation complexity convex nonconvex optimazation programming randomized stochastic). Showing records 151 – 180 of 27672 total matches.

[1] … [3] [4] [5] [6] [7] [8] [9] … [923]

Search Limiters

Last 2 Years | English Only

Degrees

Languages

Country

▼ Search Limiters


Lehigh University

151. Menickelly, Matthew Joseph. Random Models in Nonlinear Optimization.

Degree: PhD, Industrial Engineering, 2017, Lehigh University

 In recent years, there has been a tremendous increase in the interest of applying techniques of deterministic optimization to stochastic settings, largely motivated by problems… (more)

Subjects/Keywords: derivative-free optimization; nonconvex optimization; nonlinear optimization; optimization; stochastic optimization; Operations Research, Systems Engineering and Industrial Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Menickelly, M. J. (2017). Random Models in Nonlinear Optimization. (Doctoral Dissertation). Lehigh University. Retrieved from https://preserve.lehigh.edu/etd/2957

Chicago Manual of Style (16th Edition):

Menickelly, Matthew Joseph. “Random Models in Nonlinear Optimization.” 2017. Doctoral Dissertation, Lehigh University. Accessed December 08, 2019. https://preserve.lehigh.edu/etd/2957.

MLA Handbook (7th Edition):

Menickelly, Matthew Joseph. “Random Models in Nonlinear Optimization.” 2017. Web. 08 Dec 2019.

Vancouver:

Menickelly MJ. Random Models in Nonlinear Optimization. [Internet] [Doctoral dissertation]. Lehigh University; 2017. [cited 2019 Dec 08]. Available from: https://preserve.lehigh.edu/etd/2957.

Council of Science Editors:

Menickelly MJ. Random Models in Nonlinear Optimization. [Doctoral Dissertation]. Lehigh University; 2017. Available from: https://preserve.lehigh.edu/etd/2957


Rice University

152. Xu, Yangyang. Block Coordinate Update Method in Tensor Optimization.

Degree: PhD, Engineering, 2014, Rice University

 Block alternating minimization (BAM) has been popularly used since the 50's of last century. It partitions the variables into disjoint blocks and cyclically updates the… (more)

Subjects/Keywords: block coordinate update; tensor optimization; stochastic gradient; block proximal gradient; low-rank tensor completion; nonconvex optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xu, Y. (2014). Block Coordinate Update Method in Tensor Optimization. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/87773

Chicago Manual of Style (16th Edition):

Xu, Yangyang. “Block Coordinate Update Method in Tensor Optimization.” 2014. Doctoral Dissertation, Rice University. Accessed December 08, 2019. http://hdl.handle.net/1911/87773.

MLA Handbook (7th Edition):

Xu, Yangyang. “Block Coordinate Update Method in Tensor Optimization.” 2014. Web. 08 Dec 2019.

Vancouver:

Xu Y. Block Coordinate Update Method in Tensor Optimization. [Internet] [Doctoral dissertation]. Rice University; 2014. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/1911/87773.

Council of Science Editors:

Xu Y. Block Coordinate Update Method in Tensor Optimization. [Doctoral Dissertation]. Rice University; 2014. Available from: http://hdl.handle.net/1911/87773

153. Bonnet, Edouard. Résultats Positifs et Négatifs en Approximation et Complexité Paramétrée : Positive and Negative Results in Approximation and Parameterized Complexity.

Degree: Docteur es, Informatique, 2014, Paris 9

De nombreux problèmes de la vie réelle sont NP-Difficiles et ne peuvent pas être résolus en temps polynomial. Deux paradigmes notables pour les résoudre quand… (more)

Subjects/Keywords: Problèmes difficiles; Complexité paramétrée; Approximation; Sparsification; Hard problems; Parameterized complexity; Approximation; Sparsification; 511.4

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bonnet, E. (2014). Résultats Positifs et Négatifs en Approximation et Complexité Paramétrée : Positive and Negative Results in Approximation and Parameterized Complexity. (Doctoral Dissertation). Paris 9. Retrieved from http://www.theses.fr/2014PA090040

Chicago Manual of Style (16th Edition):

Bonnet, Edouard. “Résultats Positifs et Négatifs en Approximation et Complexité Paramétrée : Positive and Negative Results in Approximation and Parameterized Complexity.” 2014. Doctoral Dissertation, Paris 9. Accessed December 08, 2019. http://www.theses.fr/2014PA090040.

MLA Handbook (7th Edition):

Bonnet, Edouard. “Résultats Positifs et Négatifs en Approximation et Complexité Paramétrée : Positive and Negative Results in Approximation and Parameterized Complexity.” 2014. Web. 08 Dec 2019.

Vancouver:

Bonnet E. Résultats Positifs et Négatifs en Approximation et Complexité Paramétrée : Positive and Negative Results in Approximation and Parameterized Complexity. [Internet] [Doctoral dissertation]. Paris 9; 2014. [cited 2019 Dec 08]. Available from: http://www.theses.fr/2014PA090040.

Council of Science Editors:

Bonnet E. Résultats Positifs et Négatifs en Approximation et Complexité Paramétrée : Positive and Negative Results in Approximation and Parameterized Complexity. [Doctoral Dissertation]. Paris 9; 2014. Available from: http://www.theses.fr/2014PA090040


Université Montpellier II

154. Watrigant, Rémi. Approximation et complexité paramétrée de problèmes d’optimisation dans les graphes : partitions et sous-graphes : Approximation and parameterized complexity of graph optimisation problems : partitions and subgraphs.

Degree: Docteur es, Informatique, 2014, Université Montpellier II

La théorie de la NP-complétude nous apprend que pour un certain nombre de problèmes d'optimisation, il est vain d'espérer un algorithme efficace calculant une solution… (more)

Subjects/Keywords: Optimisation combinatoire; Approximation; Complexité paramétrée; Problèmes de graphes; Combinatorial optimization; Approximation; Parameterized complexity; Graph problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Watrigant, R. (2014). Approximation et complexité paramétrée de problèmes d’optimisation dans les graphes : partitions et sous-graphes : Approximation and parameterized complexity of graph optimisation problems : partitions and subgraphs. (Doctoral Dissertation). Université Montpellier II. Retrieved from http://www.theses.fr/2014MON20100

Chicago Manual of Style (16th Edition):

Watrigant, Rémi. “Approximation et complexité paramétrée de problèmes d’optimisation dans les graphes : partitions et sous-graphes : Approximation and parameterized complexity of graph optimisation problems : partitions and subgraphs.” 2014. Doctoral Dissertation, Université Montpellier II. Accessed December 08, 2019. http://www.theses.fr/2014MON20100.

MLA Handbook (7th Edition):

Watrigant, Rémi. “Approximation et complexité paramétrée de problèmes d’optimisation dans les graphes : partitions et sous-graphes : Approximation and parameterized complexity of graph optimisation problems : partitions and subgraphs.” 2014. Web. 08 Dec 2019.

Vancouver:

Watrigant R. Approximation et complexité paramétrée de problèmes d’optimisation dans les graphes : partitions et sous-graphes : Approximation and parameterized complexity of graph optimisation problems : partitions and subgraphs. [Internet] [Doctoral dissertation]. Université Montpellier II; 2014. [cited 2019 Dec 08]. Available from: http://www.theses.fr/2014MON20100.

Council of Science Editors:

Watrigant R. Approximation et complexité paramétrée de problèmes d’optimisation dans les graphes : partitions et sous-graphes : Approximation and parameterized complexity of graph optimisation problems : partitions and subgraphs. [Doctoral Dissertation]. Université Montpellier II; 2014. Available from: http://www.theses.fr/2014MON20100


Texas A&M University

155. Liu, Yao. A Packet Scheduling Mechanism for Wireless Peer-to-Peer Content Distribution.

Degree: 2013, Texas A&M University

 This thesis studies the problem of content distribution in wireless peer-to-peer networks with selfish nodes. In this problem a group of wireless nodes need to… (more)

Subjects/Keywords: Peer-to-Peer; Wireless; Game Theory; Network Coding; Randomized Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, Y. (2013). A Packet Scheduling Mechanism for Wireless Peer-to-Peer Content Distribution. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151906

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):

Liu, Yao. “A Packet Scheduling Mechanism for Wireless Peer-to-Peer Content Distribution.” 2013. Thesis, Texas A&M University. Accessed December 08, 2019. http://hdl.handle.net/1969.1/151906.

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

MLA Handbook (7th Edition):

Liu, Yao. “A Packet Scheduling Mechanism for Wireless Peer-to-Peer Content Distribution.” 2013. Web. 08 Dec 2019.

Vancouver:

Liu Y. A Packet Scheduling Mechanism for Wireless Peer-to-Peer Content Distribution. [Internet] [Thesis]. Texas A&M University; 2013. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/1969.1/151906.

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

Council of Science Editors:

Liu Y. A Packet Scheduling Mechanism for Wireless Peer-to-Peer Content Distribution. [Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151906

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


University of Minnesota

156. Razaviyayn, Meisam. Successive convex approximation: analysis and applications.

Degree: PhD, Electrical Engineering, 2014, University of Minnesota

 The block coordinate descent (BCD) method is widely used for minimizing a continuous function f of several block variables. At each iteration of this method,… (more)

Subjects/Keywords: Beamformer Design; Convex Optimization; Heterogeneous Networks; Sparse Dictionary Leaning; Successive Convex Approximation; Successive Upper-bound Minimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Razaviyayn, M. (2014). Successive convex approximation: analysis and applications. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/163884

Chicago Manual of Style (16th Edition):

Razaviyayn, Meisam. “Successive convex approximation: analysis and applications.” 2014. Doctoral Dissertation, University of Minnesota. Accessed December 08, 2019. http://hdl.handle.net/11299/163884.

MLA Handbook (7th Edition):

Razaviyayn, Meisam. “Successive convex approximation: analysis and applications.” 2014. Web. 08 Dec 2019.

Vancouver:

Razaviyayn M. Successive convex approximation: analysis and applications. [Internet] [Doctoral dissertation]. University of Minnesota; 2014. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/11299/163884.

Council of Science Editors:

Razaviyayn M. Successive convex approximation: analysis and applications. [Doctoral Dissertation]. University of Minnesota; 2014. Available from: http://hdl.handle.net/11299/163884

157. Sadi, Faiza. Algorithmes exacts et approchés pour les problèmes d'ordonnancement multi-agent à machines parallèles : Exact and approximate algorithms for multi-agent scheduling problems on parallel machines.

Degree: Docteur es, Informatique, 2015, Université François-Rabelais de Tours

Les travaux de cette thèse s’articulent autour des « problèmes d’ordonnancement multiagent avec une fonction objectif globale ». Ces modèles considèrent différents agents associés à… (more)

Subjects/Keywords: Recherche opérationnelle; Ordonnancement multi-agent; Machines parallèles; Fronts de Pareto; Complexité; Programmation dynamique; Programmation mathématique; Algorithmes évolutionnaires; Operational research; Multi-agent scheduling; Parallel machines; Pareto fronts; Complexity; Dynamic programming; Mathematical programming; Evolutionary algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sadi, F. (2015). Algorithmes exacts et approchés pour les problèmes d'ordonnancement multi-agent à machines parallèles : Exact and approximate algorithms for multi-agent scheduling problems on parallel machines. (Doctoral Dissertation). Université François-Rabelais de Tours. Retrieved from http://www.theses.fr/2015TOUR4005

Chicago Manual of Style (16th Edition):

Sadi, Faiza. “Algorithmes exacts et approchés pour les problèmes d'ordonnancement multi-agent à machines parallèles : Exact and approximate algorithms for multi-agent scheduling problems on parallel machines.” 2015. Doctoral Dissertation, Université François-Rabelais de Tours. Accessed December 08, 2019. http://www.theses.fr/2015TOUR4005.

MLA Handbook (7th Edition):

Sadi, Faiza. “Algorithmes exacts et approchés pour les problèmes d'ordonnancement multi-agent à machines parallèles : Exact and approximate algorithms for multi-agent scheduling problems on parallel machines.” 2015. Web. 08 Dec 2019.

Vancouver:

Sadi F. Algorithmes exacts et approchés pour les problèmes d'ordonnancement multi-agent à machines parallèles : Exact and approximate algorithms for multi-agent scheduling problems on parallel machines. [Internet] [Doctoral dissertation]. Université François-Rabelais de Tours; 2015. [cited 2019 Dec 08]. Available from: http://www.theses.fr/2015TOUR4005.

Council of Science Editors:

Sadi F. Algorithmes exacts et approchés pour les problèmes d'ordonnancement multi-agent à machines parallèles : Exact and approximate algorithms for multi-agent scheduling problems on parallel machines. [Doctoral Dissertation]. Université François-Rabelais de Tours; 2015. Available from: http://www.theses.fr/2015TOUR4005


University of Edinburgh

158. Liu, Weigang. Enhancing physical layer security in wireless networks with cooperative approaches.

Degree: PhD, 2016, University of Edinburgh

 Motivated by recent developments in wireless communication, this thesis aims to characterize the secrecy performance in several types of typical wireless networks. Advanced techniques are… (more)

Subjects/Keywords: 621.382; physical layer security; convex optimization; stochastic geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, W. (2016). Enhancing physical layer security in wireless networks with cooperative approaches. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/19565

Chicago Manual of Style (16th Edition):

Liu, Weigang. “Enhancing physical layer security in wireless networks with cooperative approaches.” 2016. Doctoral Dissertation, University of Edinburgh. Accessed December 08, 2019. http://hdl.handle.net/1842/19565.

MLA Handbook (7th Edition):

Liu, Weigang. “Enhancing physical layer security in wireless networks with cooperative approaches.” 2016. Web. 08 Dec 2019.

Vancouver:

Liu W. Enhancing physical layer security in wireless networks with cooperative approaches. [Internet] [Doctoral dissertation]. University of Edinburgh; 2016. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/1842/19565.

Council of Science Editors:

Liu W. Enhancing physical layer security in wireless networks with cooperative approaches. [Doctoral Dissertation]. University of Edinburgh; 2016. Available from: http://hdl.handle.net/1842/19565


McGill University

159. Alagar, Vangalur S., 1940-. The distribution of the volume of random sets and related problems on random determinants.

Degree: PhD, School of Computer Science, 1975, McGill University

Subjects/Keywords: Convex sets.; Determinants.; Stochastic processes.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Alagar, Vangalur S., 1. (1975). The distribution of the volume of random sets and related problems on random determinants. (Doctoral Dissertation). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile69035.pdf

Chicago Manual of Style (16th Edition):

Alagar, Vangalur S., 1940-. “The distribution of the volume of random sets and related problems on random determinants.” 1975. Doctoral Dissertation, McGill University. Accessed December 08, 2019. http://digitool.library.mcgill.ca/thesisfile69035.pdf.

MLA Handbook (7th Edition):

Alagar, Vangalur S., 1940-. “The distribution of the volume of random sets and related problems on random determinants.” 1975. Web. 08 Dec 2019.

Vancouver:

Alagar, Vangalur S. 1. The distribution of the volume of random sets and related problems on random determinants. [Internet] [Doctoral dissertation]. McGill University; 1975. [cited 2019 Dec 08]. Available from: http://digitool.library.mcgill.ca/thesisfile69035.pdf.

Council of Science Editors:

Alagar, Vangalur S. 1. The distribution of the volume of random sets and related problems on random determinants. [Doctoral Dissertation]. McGill University; 1975. Available from: http://digitool.library.mcgill.ca/thesisfile69035.pdf


Georgia Tech

160. Bountourelis, Theologos. Efficient pac-learning for episodic tasks with acyclic state spaces and the optimal node visitation problem in acyclic stochastic digaphs.

Degree: PhD, Industrial and Systems Engineering, 2008, Georgia Tech

 The first part of this research program concerns the development of customized and easily implementable Probably Approximately Correct (PAC)-learning algorithms for episodic tasks over acyclic… (more)

Subjects/Keywords: Computational complexity; Stochastic control; Approximate dynamic programming; Dynamic programming; PAC learning; Scheduling; Fluid relaxation; Reinforcement learning; Machine learning; Stochastic control theory; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bountourelis, T. (2008). Efficient pac-learning for episodic tasks with acyclic state spaces and the optimal node visitation problem in acyclic stochastic digaphs. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/28144

Chicago Manual of Style (16th Edition):

Bountourelis, Theologos. “Efficient pac-learning for episodic tasks with acyclic state spaces and the optimal node visitation problem in acyclic stochastic digaphs.” 2008. Doctoral Dissertation, Georgia Tech. Accessed December 08, 2019. http://hdl.handle.net/1853/28144.

MLA Handbook (7th Edition):

Bountourelis, Theologos. “Efficient pac-learning for episodic tasks with acyclic state spaces and the optimal node visitation problem in acyclic stochastic digaphs.” 2008. Web. 08 Dec 2019.

Vancouver:

Bountourelis T. Efficient pac-learning for episodic tasks with acyclic state spaces and the optimal node visitation problem in acyclic stochastic digaphs. [Internet] [Doctoral dissertation]. Georgia Tech; 2008. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/1853/28144.

Council of Science Editors:

Bountourelis T. Efficient pac-learning for episodic tasks with acyclic state spaces and the optimal node visitation problem in acyclic stochastic digaphs. [Doctoral Dissertation]. Georgia Tech; 2008. Available from: http://hdl.handle.net/1853/28144

161. JIANG KAIFENG. Algorithms for Large Scale Nuclear Norm Minimization and Convex Quadratic Semidefinite Programming Problems.

Degree: 2011, National University of Singapore

Subjects/Keywords: Nuclear norm minimization; convex quadratic semidefinite programming; partial proximal point algorithm; inexact smoothing Newton method; inexact APG

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

KAIFENG, J. (2011). Algorithms for Large Scale Nuclear Norm Minimization and Convex Quadratic Semidefinite Programming Problems. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/30701

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):

KAIFENG, JIANG. “Algorithms for Large Scale Nuclear Norm Minimization and Convex Quadratic Semidefinite Programming Problems.” 2011. Thesis, National University of Singapore. Accessed December 08, 2019. http://scholarbank.nus.edu.sg/handle/10635/30701.

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

MLA Handbook (7th Edition):

KAIFENG, JIANG. “Algorithms for Large Scale Nuclear Norm Minimization and Convex Quadratic Semidefinite Programming Problems.” 2011. Web. 08 Dec 2019.

Vancouver:

KAIFENG J. Algorithms for Large Scale Nuclear Norm Minimization and Convex Quadratic Semidefinite Programming Problems. [Internet] [Thesis]. National University of Singapore; 2011. [cited 2019 Dec 08]. Available from: http://scholarbank.nus.edu.sg/handle/10635/30701.

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

Council of Science Editors:

KAIFENG J. Algorithms for Large Scale Nuclear Norm Minimization and Convex Quadratic Semidefinite Programming Problems. [Thesis]. National University of Singapore; 2011. Available from: http://scholarbank.nus.edu.sg/handle/10635/30701

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

162. Gao, Zheming. Rescaled Pure Greedy Algorithm for Convex Optimization.

Degree: 2016, Texas A&M University

 In this thesis, we suggest a new algorithm for solving convex optimization problems in Banach spaces. This algorithm is based on a greedy strategy, and… (more)

Subjects/Keywords: Greedy Algorithm; Convex Optimization

algorithm for convex optimization based on one dimensional optimization at each step, which does… …new algorithm for finding the minimum of a convex function with parameter µ and a dictionary… …recursively, using the dictionary D. Some methods, such as the Weak Chebychev Greedy Algorithm, see… …only if the minimum of E is attained in the convex hull of D, since the approximant xm is… …derived as a convex combination of xm−1 and φm . In this thesis, we introduce a new greedy… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gao, Z. (2016). Rescaled Pure Greedy Algorithm for Convex Optimization. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/157019

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):

Gao, Zheming. “Rescaled Pure Greedy Algorithm for Convex Optimization.” 2016. Thesis, Texas A&M University. Accessed December 08, 2019. http://hdl.handle.net/1969.1/157019.

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

MLA Handbook (7th Edition):

Gao, Zheming. “Rescaled Pure Greedy Algorithm for Convex Optimization.” 2016. Web. 08 Dec 2019.

Vancouver:

Gao Z. Rescaled Pure Greedy Algorithm for Convex Optimization. [Internet] [Thesis]. Texas A&M University; 2016. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/1969.1/157019.

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

Council of Science Editors:

Gao Z. Rescaled Pure Greedy Algorithm for Convex Optimization. [Thesis]. Texas A&M University; 2016. Available from: http://hdl.handle.net/1969.1/157019

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


University of South Africa

163. Venter, Geertien. Bydraes tot die oplossing van die veralgemeende knapsakprobleem .

Degree: 2013, University of South Africa

 In this thesis contributions to the solution of the generalised knapsack problem are given and discussed. Attention is given to problems with functions that are… (more)

Subjects/Keywords: Knapsakprobleem; Hulpbrontoekenningsprobleem; Nielineer; Konvekse knapsakprobleem; Niekonvekse knapsakprobleem; Niekonvekse optimering; Nielineere optimering; Heuristiek; Nodige voorwaardes; Voldoende voorwaardes; Toetsprobleme; Knapsack problem; Resource allocation problem; Nonlinear knapsack problem; Convex knapsack; Nonconvex knapsack problem; Nonconvex optimisation; Nonlinear optimisation; Heuristic; Necessary conditions; Sufficient conditions; Test problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Venter, G. (2013). Bydraes tot die oplossing van die veralgemeende knapsakprobleem . (Doctoral Dissertation). University of South Africa. Retrieved from http://hdl.handle.net/10500/8603

Chicago Manual of Style (16th Edition):

Venter, Geertien. “Bydraes tot die oplossing van die veralgemeende knapsakprobleem .” 2013. Doctoral Dissertation, University of South Africa. Accessed December 08, 2019. http://hdl.handle.net/10500/8603.

MLA Handbook (7th Edition):

Venter, Geertien. “Bydraes tot die oplossing van die veralgemeende knapsakprobleem .” 2013. Web. 08 Dec 2019.

Vancouver:

Venter G. Bydraes tot die oplossing van die veralgemeende knapsakprobleem . [Internet] [Doctoral dissertation]. University of South Africa; 2013. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10500/8603.

Council of Science Editors:

Venter G. Bydraes tot die oplossing van die veralgemeende knapsakprobleem . [Doctoral Dissertation]. University of South Africa; 2013. Available from: http://hdl.handle.net/10500/8603


University of Western Ontario

164. Gao, Yuan. Advanced Topics on State Complexity of Combined Operations.

Degree: 2010, University of Western Ontario

 State complexity is a fundamental topic in formal languages and automata theory. The study of state complexity is also strongly motivated by applications of finite… (more)

Subjects/Keywords: state complexity; regular languages; combined operations; deterministic finite automata; estimation of state complexity; approximation of state complexity; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gao, Y. (2010). Advanced Topics on State Complexity of Combined Operations. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/65

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):

Gao, Yuan. “Advanced Topics on State Complexity of Combined Operations.” 2010. Thesis, University of Western Ontario. Accessed December 08, 2019. https://ir.lib.uwo.ca/etd/65.

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

MLA Handbook (7th Edition):

Gao, Yuan. “Advanced Topics on State Complexity of Combined Operations.” 2010. Web. 08 Dec 2019.

Vancouver:

Gao Y. Advanced Topics on State Complexity of Combined Operations. [Internet] [Thesis]. University of Western Ontario; 2010. [cited 2019 Dec 08]. Available from: https://ir.lib.uwo.ca/etd/65.

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

Council of Science Editors:

Gao Y. Advanced Topics on State Complexity of Combined Operations. [Thesis]. University of Western Ontario; 2010. Available from: https://ir.lib.uwo.ca/etd/65

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

165. Repetti, Audrey. Algorithmes d'optimisation en grande dimension : applications à la résolution de problèmes inverses : Large scale optimization algorithms : applications to solution of inverse problems.

Degree: Docteur es, Signal, Image, Automatique, 2015, Université Paris-Est

 Une approche efficace pour la résolution de problèmes inverses consiste à définir le signal (ou l'image) recherché(e) par minimisation d'un critère pénalisé. Ce dernier s'écrit… (more)

Subjects/Keywords: Méthodes proximales; Majoration-Minimisation; Optimisation convexe; Optimisation non convexe; Méthodes primales-Duales; Restauration; Proximal methods; Majorization-Minimization; Convex optimization; Nonconvex optimization; Primal-Dual methods; Restoration

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Repetti, A. (2015). Algorithmes d'optimisation en grande dimension : applications à la résolution de problèmes inverses : Large scale optimization algorithms : applications to solution of inverse problems. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2015PESC1032

Chicago Manual of Style (16th Edition):

Repetti, Audrey. “Algorithmes d'optimisation en grande dimension : applications à la résolution de problèmes inverses : Large scale optimization algorithms : applications to solution of inverse problems.” 2015. Doctoral Dissertation, Université Paris-Est. Accessed December 08, 2019. http://www.theses.fr/2015PESC1032.

MLA Handbook (7th Edition):

Repetti, Audrey. “Algorithmes d'optimisation en grande dimension : applications à la résolution de problèmes inverses : Large scale optimization algorithms : applications to solution of inverse problems.” 2015. Web. 08 Dec 2019.

Vancouver:

Repetti A. Algorithmes d'optimisation en grande dimension : applications à la résolution de problèmes inverses : Large scale optimization algorithms : applications to solution of inverse problems. [Internet] [Doctoral dissertation]. Université Paris-Est; 2015. [cited 2019 Dec 08]. Available from: http://www.theses.fr/2015PESC1032.

Council of Science Editors:

Repetti A. Algorithmes d'optimisation en grande dimension : applications à la résolution de problèmes inverses : Large scale optimization algorithms : applications to solution of inverse problems. [Doctoral Dissertation]. Université Paris-Est; 2015. Available from: http://www.theses.fr/2015PESC1032


Syracuse University

166. Malandrino, Rigby Dawn. Generalization Programming and Performance Feedback: A Writing Intervention with Third-Grade Students.

Degree: PhD, Psychology, 2017, Syracuse University

  Despite the importance of explicitly programming generalization in the context of intervention studies (Stokes & Osnes, 1989), the research base is limited, especially with… (more)

Subjects/Keywords: academic intervention; generalization programming; randomized trial; writing; Social and Behavioral Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Malandrino, R. D. (2017). Generalization Programming and Performance Feedback: A Writing Intervention with Third-Grade Students. (Doctoral Dissertation). Syracuse University. Retrieved from https://surface.syr.edu/etd/834

Chicago Manual of Style (16th Edition):

Malandrino, Rigby Dawn. “Generalization Programming and Performance Feedback: A Writing Intervention with Third-Grade Students.” 2017. Doctoral Dissertation, Syracuse University. Accessed December 08, 2019. https://surface.syr.edu/etd/834.

MLA Handbook (7th Edition):

Malandrino, Rigby Dawn. “Generalization Programming and Performance Feedback: A Writing Intervention with Third-Grade Students.” 2017. Web. 08 Dec 2019.

Vancouver:

Malandrino RD. Generalization Programming and Performance Feedback: A Writing Intervention with Third-Grade Students. [Internet] [Doctoral dissertation]. Syracuse University; 2017. [cited 2019 Dec 08]. Available from: https://surface.syr.edu/etd/834.

Council of Science Editors:

Malandrino RD. Generalization Programming and Performance Feedback: A Writing Intervention with Third-Grade Students. [Doctoral Dissertation]. Syracuse University; 2017. Available from: https://surface.syr.edu/etd/834

167. Wang, Guanglei. Relaxations in mixed-integer quadratically constrained programming and robust programming : Relaxations en programmation mixte en nombres entiers avec contraintes quadratiques et en programmation robuste.

Degree: Docteur es, Informatique, 2016, Evry, Institut national des télécommunications

De nombreux problèmes de la vie réelle sont exprimés sous la forme de décisions à prendre à l’aide de l’information accessible dans le but d’atteindre… (more)

Subjects/Keywords: MIQCP; Optimisation robuste; Relaxation convexe; Incertitude; Enveloppe convexe; Approximation polyédrale; Décomposition; Problème d'affectation; MIQCP; Robust optimization; Convex relaxation; Uncertainty; Convex envelope; Polyhedral approximation; Decomposition; Assignment problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, G. (2016). Relaxations in mixed-integer quadratically constrained programming and robust programming : Relaxations en programmation mixte en nombres entiers avec contraintes quadratiques et en programmation robuste. (Doctoral Dissertation). Evry, Institut national des télécommunications. Retrieved from http://www.theses.fr/2016TELE0026

Chicago Manual of Style (16th Edition):

Wang, Guanglei. “Relaxations in mixed-integer quadratically constrained programming and robust programming : Relaxations en programmation mixte en nombres entiers avec contraintes quadratiques et en programmation robuste.” 2016. Doctoral Dissertation, Evry, Institut national des télécommunications. Accessed December 08, 2019. http://www.theses.fr/2016TELE0026.

MLA Handbook (7th Edition):

Wang, Guanglei. “Relaxations in mixed-integer quadratically constrained programming and robust programming : Relaxations en programmation mixte en nombres entiers avec contraintes quadratiques et en programmation robuste.” 2016. Web. 08 Dec 2019.

Vancouver:

Wang G. Relaxations in mixed-integer quadratically constrained programming and robust programming : Relaxations en programmation mixte en nombres entiers avec contraintes quadratiques et en programmation robuste. [Internet] [Doctoral dissertation]. Evry, Institut national des télécommunications; 2016. [cited 2019 Dec 08]. Available from: http://www.theses.fr/2016TELE0026.

Council of Science Editors:

Wang G. Relaxations in mixed-integer quadratically constrained programming and robust programming : Relaxations en programmation mixte en nombres entiers avec contraintes quadratiques et en programmation robuste. [Doctoral Dissertation]. Evry, Institut national des télécommunications; 2016. Available from: http://www.theses.fr/2016TELE0026


Western Kentucky University

168. Cheng, Gang. Analyzing and Solving Non-Linear Stochastic Dynamic Models on Non-Periodic Discrete Time Domains.

Degree: MS, Department of Mathematics, 2013, Western Kentucky University

Stochastic dynamic programming is a recursive method for solving sequential or multistage decision problems. It helps economists and mathematicians construct and solve a huge… (more)

Subjects/Keywords: Dynamic Programming; Stochastic Programming; Stochastic Control Theory; Stochastic Differential Equations; Stochastic Analysis; Martingales (Mathematics); Analysis; Applied Mathematics; Mathematics; Statistics and Probability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cheng, G. (2013). Analyzing and Solving Non-Linear Stochastic Dynamic Models on Non-Periodic Discrete Time Domains. (Masters Thesis). Western Kentucky University. Retrieved from https://digitalcommons.wku.edu/theses/1236

Chicago Manual of Style (16th Edition):

Cheng, Gang. “Analyzing and Solving Non-Linear Stochastic Dynamic Models on Non-Periodic Discrete Time Domains.” 2013. Masters Thesis, Western Kentucky University. Accessed December 08, 2019. https://digitalcommons.wku.edu/theses/1236.

MLA Handbook (7th Edition):

Cheng, Gang. “Analyzing and Solving Non-Linear Stochastic Dynamic Models on Non-Periodic Discrete Time Domains.” 2013. Web. 08 Dec 2019.

Vancouver:

Cheng G. Analyzing and Solving Non-Linear Stochastic Dynamic Models on Non-Periodic Discrete Time Domains. [Internet] [Masters thesis]. Western Kentucky University; 2013. [cited 2019 Dec 08]. Available from: https://digitalcommons.wku.edu/theses/1236.

Council of Science Editors:

Cheng G. Analyzing and Solving Non-Linear Stochastic Dynamic Models on Non-Periodic Discrete Time Domains. [Masters Thesis]. Western Kentucky University; 2013. Available from: https://digitalcommons.wku.edu/theses/1236


University of Vienna

169. Kastner, Klaus. Stochastic primal-dual forward-backward-forward algorithm with applications in machine learning.

Degree: 2018, University of Vienna

Wir präsentieren ein stochastisches Primal-duales Vorwärts-Rückwärts-Vorwärts Verfahren zum Lösen des monotonen Inklusions-Problems, welches maximal- monotone Operatoren, lineare Zusammensetzungen paralleler Summen von maximal- monotonen Operatoren und… (more)

Subjects/Keywords: 31.46 Funktionalanalysis; 31.47 Operatortheorie; 31.70 Wahrscheinlichkeitsrechnung; 31.76 Numerische Mathematik; 31.80 Angewandte Mathematik; 31.40 Analysis: Allgemeines; 54.72 Künstliche Intelligenz; Zufallsvariablen / stochastische quasi-Fejér monotone Folge / stochastischer Algorithmus / maximal-monotone Operatoren / Resolvente / konvexes Optimierungsproblem / Subdifferential / Kernel-basiertes maschinelles Lernen / Support Vector Maschine / numerische Experimente; arbitrary sampling / block-coordinate algorithm / random variables / stochastic algorithm / stochastic Fejer-monotone sequence / maximally monotone operator / resolvent / convex optimization / subdifferential / kernel-based machine learning / support vector machine / numerical experiments

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kastner, K. (2018). Stochastic primal-dual forward-backward-forward algorithm with applications in machine learning. (Thesis). University of Vienna. Retrieved from http://othes.univie.ac.at/53897/

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):

Kastner, Klaus. “Stochastic primal-dual forward-backward-forward algorithm with applications in machine learning.” 2018. Thesis, University of Vienna. Accessed December 08, 2019. http://othes.univie.ac.at/53897/.

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

MLA Handbook (7th Edition):

Kastner, Klaus. “Stochastic primal-dual forward-backward-forward algorithm with applications in machine learning.” 2018. Web. 08 Dec 2019.

Vancouver:

Kastner K. Stochastic primal-dual forward-backward-forward algorithm with applications in machine learning. [Internet] [Thesis]. University of Vienna; 2018. [cited 2019 Dec 08]. Available from: http://othes.univie.ac.at/53897/.

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

Council of Science Editors:

Kastner K. Stochastic primal-dual forward-backward-forward algorithm with applications in machine learning. [Thesis]. University of Vienna; 2018. Available from: http://othes.univie.ac.at/53897/

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


Université de Montréal

170. Bégin, Jean-François. New simulation schemes for the Heston model .

Degree: 2012, Université de Montréal

 Les titres financiers sont souvent modélisés par des équations différentielles stochastiques (ÉDS). Ces équations peuvent décrire le comportement de l'actif, et aussi parfois certains paramètres… (more)

Subjects/Keywords: Volatilité stochastique; Stochastic volatility; Algorithmes de simulation; Simulation schemes; Tarification de produits dérivés; Asset pricing; MCMC; Algorithme de Metropolis-Hastings; Metropolis-Hastings algorithm; Modèle de Heston; Heston model; Options asiatiques; Asian options; Approximation; Approximations; Loi gamma; Gamma distribution

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bégin, J. (2012). New simulation schemes for the Heston model . (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/8752

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):

Bégin, Jean-François. “New simulation schemes for the Heston model .” 2012. Thesis, Université de Montréal. Accessed December 08, 2019. http://hdl.handle.net/1866/8752.

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

MLA Handbook (7th Edition):

Bégin, Jean-François. “New simulation schemes for the Heston model .” 2012. Web. 08 Dec 2019.

Vancouver:

Bégin J. New simulation schemes for the Heston model . [Internet] [Thesis]. Université de Montréal; 2012. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/1866/8752.

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

Council of Science Editors:

Bégin J. New simulation schemes for the Heston model . [Thesis]. Université de Montréal; 2012. Available from: http://hdl.handle.net/1866/8752

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


Delft University of Technology

171. Feldman, A.B. Approximation Algorithms for Model-Based Diagnosis.

Degree: 2010, Delft University of Technology

 Model-based diagnosis is an area of abductive inference that uses a system model, together with observations about system behavior, to isolate sets of faulty components… (more)

Subjects/Keywords: model-based diagnosis; model-based reasoning; diagnosis; automated fault diagnosis; automated reasoning; stochastic search; approximation algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Feldman, A. B. (2010). Approximation Algorithms for Model-Based Diagnosis. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:2d24eb78-c308-49fb-a7a4-2021b40b77fd ; urn:NBN:nl:ui:24-uuid:2d24eb78-c308-49fb-a7a4-2021b40b77fd ; urn:NBN:nl:ui:24-uuid:2d24eb78-c308-49fb-a7a4-2021b40b77fd ; http://resolver.tudelft.nl/uuid:2d24eb78-c308-49fb-a7a4-2021b40b77fd

Chicago Manual of Style (16th Edition):

Feldman, A B. “Approximation Algorithms for Model-Based Diagnosis.” 2010. Doctoral Dissertation, Delft University of Technology. Accessed December 08, 2019. http://resolver.tudelft.nl/uuid:2d24eb78-c308-49fb-a7a4-2021b40b77fd ; urn:NBN:nl:ui:24-uuid:2d24eb78-c308-49fb-a7a4-2021b40b77fd ; urn:NBN:nl:ui:24-uuid:2d24eb78-c308-49fb-a7a4-2021b40b77fd ; http://resolver.tudelft.nl/uuid:2d24eb78-c308-49fb-a7a4-2021b40b77fd.

MLA Handbook (7th Edition):

Feldman, A B. “Approximation Algorithms for Model-Based Diagnosis.” 2010. Web. 08 Dec 2019.

Vancouver:

Feldman AB. Approximation Algorithms for Model-Based Diagnosis. [Internet] [Doctoral dissertation]. Delft University of Technology; 2010. [cited 2019 Dec 08]. Available from: http://resolver.tudelft.nl/uuid:2d24eb78-c308-49fb-a7a4-2021b40b77fd ; urn:NBN:nl:ui:24-uuid:2d24eb78-c308-49fb-a7a4-2021b40b77fd ; urn:NBN:nl:ui:24-uuid:2d24eb78-c308-49fb-a7a4-2021b40b77fd ; http://resolver.tudelft.nl/uuid:2d24eb78-c308-49fb-a7a4-2021b40b77fd.

Council of Science Editors:

Feldman AB. Approximation Algorithms for Model-Based Diagnosis. [Doctoral Dissertation]. Delft University of Technology; 2010. Available from: http://resolver.tudelft.nl/uuid:2d24eb78-c308-49fb-a7a4-2021b40b77fd ; urn:NBN:nl:ui:24-uuid:2d24eb78-c308-49fb-a7a4-2021b40b77fd ; urn:NBN:nl:ui:24-uuid:2d24eb78-c308-49fb-a7a4-2021b40b77fd ; http://resolver.tudelft.nl/uuid:2d24eb78-c308-49fb-a7a4-2021b40b77fd


Uppsala University

172. Mattsson, Per. The Asymmetric Traveling Salesman Problem.

Degree: Mathematics, 2010, Uppsala University

  This thesis is a survey on the approximability of the asymmetric traveling salesmanproblem with triangle inequality (ATSP).In the ATSP we are given a set… (more)

Subjects/Keywords: atsp; asymmetric traveling salesman problem; approximation algorithms; computational complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mattsson, P. (2010). The Asymmetric Traveling Salesman Problem. (Thesis). Uppsala University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-132624

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):

Mattsson, Per. “The Asymmetric Traveling Salesman Problem.” 2010. Thesis, Uppsala University. Accessed December 08, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-132624.

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

MLA Handbook (7th Edition):

Mattsson, Per. “The Asymmetric Traveling Salesman Problem.” 2010. Web. 08 Dec 2019.

Vancouver:

Mattsson P. The Asymmetric Traveling Salesman Problem. [Internet] [Thesis]. Uppsala University; 2010. [cited 2019 Dec 08]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-132624.

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

Council of Science Editors:

Mattsson P. The Asymmetric Traveling Salesman Problem. [Thesis]. Uppsala University; 2010. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-132624

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

173. Pajote, Sara Cristina Cupido Carmo Grou Sim Sim. Redução do índice de complexidade da medicação em lar de idosos.

Degree: 2009, Universidade de Évora

 Objectivo: este estudo centrava-se na avaliação da eficácia da intervenção de um farmacêutico na Redução do Grau de Complexidade da Medicação num Lar de Idosos.… (more)

Subjects/Keywords: Complexidade da medicação; Idosos; Ensaio controlado randomizado; Polimedicação; Medication complexity; Elderly; Randomized controlled trial; Polypharmacy

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pajote, S. C. C. C. G. S. S. (2009). Redução do índice de complexidade da medicação em lar de idosos. (Thesis). Universidade de Évora. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:dspace.uevora.pt:10174/18511

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):

Pajote, Sara Cristina Cupido Carmo Grou Sim Sim. “Redução do índice de complexidade da medicação em lar de idosos.” 2009. Thesis, Universidade de Évora. Accessed December 08, 2019. http://www.rcaap.pt/detail.jsp?id=oai:dspace.uevora.pt:10174/18511.

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

MLA Handbook (7th Edition):

Pajote, Sara Cristina Cupido Carmo Grou Sim Sim. “Redução do índice de complexidade da medicação em lar de idosos.” 2009. Web. 08 Dec 2019.

Vancouver:

Pajote SCCCGSS. Redução do índice de complexidade da medicação em lar de idosos. [Internet] [Thesis]. Universidade de Évora; 2009. [cited 2019 Dec 08]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:dspace.uevora.pt:10174/18511.

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

Council of Science Editors:

Pajote SCCCGSS. Redução do índice de complexidade da medicação em lar de idosos. [Thesis]. Universidade de Évora; 2009. Available from: http://www.rcaap.pt/detail.jsp?id=oai:dspace.uevora.pt:10174/18511

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


Delft University of Technology

174. Van Vliet, E. Axisymmetrical topology optimization of an FPSO main bearing support structure:.

Degree: 2015, Delft University of Technology

A study in the application of topology optimization to problems of realtive nature, as found in the load distribution within an FPSO main bearing. Advisors/Committee Members: L. Kiminski, M..

Subjects/Keywords: topology optimization; structural mechanics; relative constraints; method of moving asymptotes; FPSO; convex approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Van Vliet, E. (2015). Axisymmetrical topology optimization of an FPSO main bearing support structure:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:3243480a-1845-4ea0-bdc9-6f928405f561

Chicago Manual of Style (16th Edition):

Van Vliet, E. “Axisymmetrical topology optimization of an FPSO main bearing support structure:.” 2015. Masters Thesis, Delft University of Technology. Accessed December 08, 2019. http://resolver.tudelft.nl/uuid:3243480a-1845-4ea0-bdc9-6f928405f561.

MLA Handbook (7th Edition):

Van Vliet, E. “Axisymmetrical topology optimization of an FPSO main bearing support structure:.” 2015. Web. 08 Dec 2019.

Vancouver:

Van Vliet E. Axisymmetrical topology optimization of an FPSO main bearing support structure:. [Internet] [Masters thesis]. Delft University of Technology; 2015. [cited 2019 Dec 08]. Available from: http://resolver.tudelft.nl/uuid:3243480a-1845-4ea0-bdc9-6f928405f561.

Council of Science Editors:

Van Vliet E. Axisymmetrical topology optimization of an FPSO main bearing support structure:. [Masters Thesis]. Delft University of Technology; 2015. Available from: http://resolver.tudelft.nl/uuid:3243480a-1845-4ea0-bdc9-6f928405f561

175. Wang, Jing. Wireless Sensor Localization With Distance Measurement Information.

Degree: PhD, Electrical Engineering and Computer Science, 2011, The Catholic University of America

Degree awarded: Ph.D. Electrical Engineering and Computer Science. The Catholic University of America

The dissertation would focus on two problems: localization in wireless sensor network… (more)

Subjects/Keywords: Electrical Engineering; Convex sets; Distance measurements reconstruction; Inertial approximation; Wireless sensor localization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, J. (2011). Wireless Sensor Localization With Distance Measurement Information. (Doctoral Dissertation). The Catholic University of America. Retrieved from http://hdl.handle.net/1961/9320

Chicago Manual of Style (16th Edition):

Wang, Jing. “Wireless Sensor Localization With Distance Measurement Information.” 2011. Doctoral Dissertation, The Catholic University of America. Accessed December 08, 2019. http://hdl.handle.net/1961/9320.

MLA Handbook (7th Edition):

Wang, Jing. “Wireless Sensor Localization With Distance Measurement Information.” 2011. Web. 08 Dec 2019.

Vancouver:

Wang J. Wireless Sensor Localization With Distance Measurement Information. [Internet] [Doctoral dissertation]. The Catholic University of America; 2011. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/1961/9320.

Council of Science Editors:

Wang J. Wireless Sensor Localization With Distance Measurement Information. [Doctoral Dissertation]. The Catholic University of America; 2011. Available from: http://hdl.handle.net/1961/9320


University of California – Berkeley

176. Wong, Chiu Wai. Optimization Everywhere: Convex, Combinatorial, and Economic.

Degree: Computer Science, 2018, University of California – Berkeley

 In this thesis we study fundamental problems that arise in optimization and its applications. We present provably efficient algorithms that achieve better running times or… (more)

Subjects/Keywords: Computer science; Mathematics; Operations research; Approximation Algorithms; Combinatorial Optimization; Convex Optimization; Market Equilibrium; Submodular Functions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wong, C. W. (2018). Optimization Everywhere: Convex, Combinatorial, and Economic. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/1f977832

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):

Wong, Chiu Wai. “Optimization Everywhere: Convex, Combinatorial, and Economic.” 2018. Thesis, University of California – Berkeley. Accessed December 08, 2019. http://www.escholarship.org/uc/item/1f977832.

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

MLA Handbook (7th Edition):

Wong, Chiu Wai. “Optimization Everywhere: Convex, Combinatorial, and Economic.” 2018. Web. 08 Dec 2019.

Vancouver:

Wong CW. Optimization Everywhere: Convex, Combinatorial, and Economic. [Internet] [Thesis]. University of California – Berkeley; 2018. [cited 2019 Dec 08]. Available from: http://www.escholarship.org/uc/item/1f977832.

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

Council of Science Editors:

Wong CW. Optimization Everywhere: Convex, Combinatorial, and Economic. [Thesis]. University of California – Berkeley; 2018. Available from: http://www.escholarship.org/uc/item/1f977832

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


University of Toronto

177. Cheeseman, Alison. Adaptive Waveform Design and CFAR Processing for High Frequency Surface Wave Radar.

Degree: 2017, University of Toronto

High frequency surface wave radar (HFSWR), used for coastal surveillance, operates in a challenging environment as the clutter signals returned from the ocean surface can… (more)

Subjects/Keywords: alternating projections; CFAR; radar; sea clutter; spectral coexistence; successive convex approximation; 0544

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cheeseman, A. (2017). Adaptive Waveform Design and CFAR Processing for High Frequency Surface Wave Radar. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/79106

Chicago Manual of Style (16th Edition):

Cheeseman, Alison. “Adaptive Waveform Design and CFAR Processing for High Frequency Surface Wave Radar.” 2017. Masters Thesis, University of Toronto. Accessed December 08, 2019. http://hdl.handle.net/1807/79106.

MLA Handbook (7th Edition):

Cheeseman, Alison. “Adaptive Waveform Design and CFAR Processing for High Frequency Surface Wave Radar.” 2017. Web. 08 Dec 2019.

Vancouver:

Cheeseman A. Adaptive Waveform Design and CFAR Processing for High Frequency Surface Wave Radar. [Internet] [Masters thesis]. University of Toronto; 2017. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/1807/79106.

Council of Science Editors:

Cheeseman A. Adaptive Waveform Design and CFAR Processing for High Frequency Surface Wave Radar. [Masters Thesis]. University of Toronto; 2017. Available from: http://hdl.handle.net/1807/79106

178. Kilpatrick, Alastair Morris. Novel stochastic and entropy-based Expectation-Maximisation algorithm for transcription factor binding site motif discovery.

Degree: PhD, 2015, University of Edinburgh

 The discovery of transcription factor binding site (TFBS) motifs remains an important and challenging problem in computational biology. This thesis presents MITSU, a novel algorithm(more)

Subjects/Keywords: 572.8; stochastic Expectation- Maximisation; stochastic EM; algorithm; motif discovery

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Sample image

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kilpatrick, A. M. (2015). Novel stochastic and entropy-based Expectation-Maximisation algorithm for transcription factor binding site motif discovery. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/10489

Chicago Manual of Style (16th Edition):

Kilpatrick, Alastair Morris. “Novel stochastic and entropy-based Expectation-Maximisation algorithm for transcription factor binding site motif discovery.” 2015. Doctoral Dissertation, University of Edinburgh. Accessed December 08, 2019. http://hdl.handle.net/1842/10489.

MLA Handbook (7th Edition):

Kilpatrick, Alastair Morris. “Novel stochastic and entropy-based Expectation-Maximisation algorithm for transcription factor binding site motif discovery.” 2015. Web. 08 Dec 2019.

Vancouver:

Kilpatrick AM. Novel stochastic and entropy-based Expectation-Maximisation algorithm for transcription factor binding site motif discovery. [Internet] [Doctoral dissertation]. University of Edinburgh; 2015. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/1842/10489.

Council of Science Editors:

Kilpatrick AM. Novel stochastic and entropy-based Expectation-Maximisation algorithm for transcription factor binding site motif discovery. [Doctoral Dissertation]. University of Edinburgh; 2015. Available from: http://hdl.handle.net/1842/10489


Virginia Tech

179. Chen, Minghan. Stochastic Modeling and Simulation of Multiscale Biochemical Systems.

Degree: PhD, Computer Science and Applications, 2019, Virginia Tech

 Modeling and simulation of biochemical networks faces numerous challenges as biochemical networks are discovered with increased complexity and unknown mechanisms. With improvement in experimental techniques,… (more)

Subjects/Keywords: Caulobacter cell cycle model; hybrid stochastic simulation algorithm; stochastic parameter optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, M. (2019). Stochastic Modeling and Simulation of Multiscale Biochemical Systems. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/90898

Chicago Manual of Style (16th Edition):

Chen, Minghan. “Stochastic Modeling and Simulation of Multiscale Biochemical Systems.” 2019. Doctoral Dissertation, Virginia Tech. Accessed December 08, 2019. http://hdl.handle.net/10919/90898.

MLA Handbook (7th Edition):

Chen, Minghan. “Stochastic Modeling and Simulation of Multiscale Biochemical Systems.” 2019. Web. 08 Dec 2019.

Vancouver:

Chen M. Stochastic Modeling and Simulation of Multiscale Biochemical Systems. [Internet] [Doctoral dissertation]. Virginia Tech; 2019. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10919/90898.

Council of Science Editors:

Chen M. Stochastic Modeling and Simulation of Multiscale Biochemical Systems. [Doctoral Dissertation]. Virginia Tech; 2019. Available from: http://hdl.handle.net/10919/90898

180. Ait El Faqir, Marouane. Prédiction de la structure de contrôle de bactéries par optimisation sous incertitude : Magnetic resonance elastography : contributions to acquisition and reconstruction of the shear modulus : association with quasi-static ultrasound elastography to study the effect of pre-strain.

Degree: Docteur es, Automatique, 2016, Lyon

L'approche de la biologie des systèmes vise à intégrer les méthodologies appliquées dans la conception et l'analyse des systèmes technologiques complexes, au sein de la… (more)

Subjects/Keywords: Optimisation stochastique; Méthodes du Premier Ordre; Optimisation déterministe; Approximation Stochastique; RBA; Stochastic optimization; First Order Methods; Deterministic optimisation; Stochastic Approximation; RBA

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ait El Faqir, M. (2016). Prédiction de la structure de contrôle de bactéries par optimisation sous incertitude : Magnetic resonance elastography : contributions to acquisition and reconstruction of the shear modulus : association with quasi-static ultrasound elastography to study the effect of pre-strain. (Doctoral Dissertation). Lyon. Retrieved from http://www.theses.fr/2016LYSEC036

Chicago Manual of Style (16th Edition):

Ait El Faqir, Marouane. “Prédiction de la structure de contrôle de bactéries par optimisation sous incertitude : Magnetic resonance elastography : contributions to acquisition and reconstruction of the shear modulus : association with quasi-static ultrasound elastography to study the effect of pre-strain.” 2016. Doctoral Dissertation, Lyon. Accessed December 08, 2019. http://www.theses.fr/2016LYSEC036.

MLA Handbook (7th Edition):

Ait El Faqir, Marouane. “Prédiction de la structure de contrôle de bactéries par optimisation sous incertitude : Magnetic resonance elastography : contributions to acquisition and reconstruction of the shear modulus : association with quasi-static ultrasound elastography to study the effect of pre-strain.” 2016. Web. 08 Dec 2019.

Vancouver:

Ait El Faqir M. Prédiction de la structure de contrôle de bactéries par optimisation sous incertitude : Magnetic resonance elastography : contributions to acquisition and reconstruction of the shear modulus : association with quasi-static ultrasound elastography to study the effect of pre-strain. [Internet] [Doctoral dissertation]. Lyon; 2016. [cited 2019 Dec 08]. Available from: http://www.theses.fr/2016LYSEC036.

Council of Science Editors:

Ait El Faqir M. Prédiction de la structure de contrôle de bactéries par optimisation sous incertitude : Magnetic resonance elastography : contributions to acquisition and reconstruction of the shear modulus : association with quasi-static ultrasound elastography to study the effect of pre-strain. [Doctoral Dissertation]. Lyon; 2016. Available from: http://www.theses.fr/2016LYSEC036

[1] … [3] [4] [5] [6] [7] [8] [9] … [923]

.