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:(Lower bounds). Showing records 1 – 30 of 56 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

Degrees

Country

▼ Search Limiters


Texas A&M University

1. Farnsworth, Cameron Lee. The Polynomial Waring Problem and the Determinant.

Degree: 2016, Texas A&M University

 The symmetric rank of a polynomial P is the minimum number of d-th powers of linear forms necessary to sum to P. Questions pertaining to… (more)

Subjects/Keywords: symmetric border rank; lower bounds; determinant; permanent

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Farnsworth, C. L. (2016). The Polynomial Waring Problem and the Determinant. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/157889

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

Farnsworth, Cameron Lee. “The Polynomial Waring Problem and the Determinant.” 2016. Thesis, Texas A&M University. Accessed February 21, 2020. http://hdl.handle.net/1969.1/157889.

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

MLA Handbook (7th Edition):

Farnsworth, Cameron Lee. “The Polynomial Waring Problem and the Determinant.” 2016. Web. 21 Feb 2020.

Vancouver:

Farnsworth CL. The Polynomial Waring Problem and the Determinant. [Internet] [Thesis]. Texas A&M University; 2016. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/1969.1/157889.

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

Council of Science Editors:

Farnsworth CL. The Polynomial Waring Problem and the Determinant. [Thesis]. Texas A&M University; 2016. Available from: http://hdl.handle.net/1969.1/157889

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


Università della Svizzera italiana

2. Schiper, Nicolas. On multicast primitives in large networks and partial replication protocols.

Degree: 2009, Università della Svizzera italiana

 Recent years have seen the rapid growth of web-based applications such as search engines, social networks, and e-commerce platforms. As a consequence, our daily life… (more)

Subjects/Keywords: Latency lower bounds

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schiper, N. (2009). On multicast primitives in large networks and partial replication protocols. (Thesis). Università della Svizzera italiana. Retrieved from http://doc.rero.ch/record/12784

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

Schiper, Nicolas. “On multicast primitives in large networks and partial replication protocols.” 2009. Thesis, Università della Svizzera italiana. Accessed February 21, 2020. http://doc.rero.ch/record/12784.

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

MLA Handbook (7th Edition):

Schiper, Nicolas. “On multicast primitives in large networks and partial replication protocols.” 2009. Web. 21 Feb 2020.

Vancouver:

Schiper N. On multicast primitives in large networks and partial replication protocols. [Internet] [Thesis]. Università della Svizzera italiana; 2009. [cited 2020 Feb 21]. Available from: http://doc.rero.ch/record/12784.

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

Council of Science Editors:

Schiper N. On multicast primitives in large networks and partial replication protocols. [Thesis]. Università della Svizzera italiana; 2009. Available from: http://doc.rero.ch/record/12784

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


Georgia Tech

3. Li, Yaxian. Lower bounds for integer programming problems.

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

 Solving real world problems with mixed integer programming (MIP) involves efforts in modeling and efficient algorithms. To solve a minimization MIP problem, a lower bound… (more)

Subjects/Keywords: Lower bounds; Integer programming problems; Multi-dimensional knapsack problem; Algorithms; Knapsack problem (Mathematics); Integer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, Y. (2013). Lower bounds for integer programming problems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/48959

Chicago Manual of Style (16th Edition):

Li, Yaxian. “Lower bounds for integer programming problems.” 2013. Doctoral Dissertation, Georgia Tech. Accessed February 21, 2020. http://hdl.handle.net/1853/48959.

MLA Handbook (7th Edition):

Li, Yaxian. “Lower bounds for integer programming problems.” 2013. Web. 21 Feb 2020.

Vancouver:

Li Y. Lower bounds for integer programming problems. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/1853/48959.

Council of Science Editors:

Li Y. Lower bounds for integer programming problems. [Doctoral Dissertation]. Georgia Tech; 2013. Available from: http://hdl.handle.net/1853/48959


Iowa State University

4. Ghasemi, Hooshang. Coded caching: Information theoretic bounds and asynchronism.

Degree: 2019, Iowa State University

 Caching is often used in content delivery networks as a mechanism for reducing network traffic. Recently, the technique of coded caching was introduced whereby coding… (more)

Subjects/Keywords: Asynchronism; Caching; Content Delivery Systems; Information Theory; Linear Programming; Lower Bounds; Electrical and Electronics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ghasemi, H. (2019). Coded caching: Information theoretic bounds and asynchronism. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/17451

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

Ghasemi, Hooshang. “Coded caching: Information theoretic bounds and asynchronism.” 2019. Thesis, Iowa State University. Accessed February 21, 2020. https://lib.dr.iastate.edu/etd/17451.

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

MLA Handbook (7th Edition):

Ghasemi, Hooshang. “Coded caching: Information theoretic bounds and asynchronism.” 2019. Web. 21 Feb 2020.

Vancouver:

Ghasemi H. Coded caching: Information theoretic bounds and asynchronism. [Internet] [Thesis]. Iowa State University; 2019. [cited 2020 Feb 21]. Available from: https://lib.dr.iastate.edu/etd/17451.

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

Council of Science Editors:

Ghasemi H. Coded caching: Information theoretic bounds and asynchronism. [Thesis]. Iowa State University; 2019. Available from: https://lib.dr.iastate.edu/etd/17451

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

5. Del Pozzo, Antonella. Building distributed computing abstractions in the presence of mobile byzantine failures : Construction d'abstraction informatique distribuée en présence de fautes Bizantines mobiles.

Degree: Docteur es, Informatique, Télécomminication et Électronique, 2017, Université Pierre et Marie Curie – Paris VI

Dans cette thèse on s’intéresse à un modèle de faute Byzantins Mobiles. Jusqu’à présent, seulement le problème du Consensus a été résolu en présente de… (more)

Subjects/Keywords: Faute Byzantine mobile; Stockage réparti; Accord approximé; Mobile Byzantine failure; Distributed register; Lower bounds; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Del Pozzo, A. (2017). Building distributed computing abstractions in the presence of mobile byzantine failures : Construction d'abstraction informatique distribuée en présence de fautes Bizantines mobiles. (Doctoral Dissertation). Université Pierre et Marie Curie – Paris VI. Retrieved from http://www.theses.fr/2017PA066159

Chicago Manual of Style (16th Edition):

Del Pozzo, Antonella. “Building distributed computing abstractions in the presence of mobile byzantine failures : Construction d'abstraction informatique distribuée en présence de fautes Bizantines mobiles.” 2017. Doctoral Dissertation, Université Pierre et Marie Curie – Paris VI. Accessed February 21, 2020. http://www.theses.fr/2017PA066159.

MLA Handbook (7th Edition):

Del Pozzo, Antonella. “Building distributed computing abstractions in the presence of mobile byzantine failures : Construction d'abstraction informatique distribuée en présence de fautes Bizantines mobiles.” 2017. Web. 21 Feb 2020.

Vancouver:

Del Pozzo A. Building distributed computing abstractions in the presence of mobile byzantine failures : Construction d'abstraction informatique distribuée en présence de fautes Bizantines mobiles. [Internet] [Doctoral dissertation]. Université Pierre et Marie Curie – Paris VI; 2017. [cited 2020 Feb 21]. Available from: http://www.theses.fr/2017PA066159.

Council of Science Editors:

Del Pozzo A. Building distributed computing abstractions in the presence of mobile byzantine failures : Construction d'abstraction informatique distribuée en présence de fautes Bizantines mobiles. [Doctoral Dissertation]. Université Pierre et Marie Curie – Paris VI; 2017. Available from: http://www.theses.fr/2017PA066159

6. Harbaoui dridi, Imen. Optimisation heuristique pour la résolution du m-PDPTW statique et dynamique : Heuristics optimization for the resolution of the m-PDPTW static and dynamic.

Degree: Docteur es, Automatique, Génie informatique et Traitement du signal, 2010, Ecole centrale de Lille; École nationale d'ingénieurs de Tunis (Tunisie)

De nos jours, le problème de transport de marchandise occupe une place importante dans la vie économique des sociétés modernes. Le problème de ramassage et… (more)

Subjects/Keywords: M-PDPTW; Algorithmes génétiques; Optimisation multicritère; Bornes inférieures; M-PDPTW; Genetic algorithms; Multicriteria optimization; Lower bounds

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Harbaoui dridi, I. (2010). Optimisation heuristique pour la résolution du m-PDPTW statique et dynamique : Heuristics optimization for the resolution of the m-PDPTW static and dynamic. (Doctoral Dissertation). Ecole centrale de Lille; École nationale d'ingénieurs de Tunis (Tunisie). Retrieved from http://www.theses.fr/2010ECLI0031

Chicago Manual of Style (16th Edition):

Harbaoui dridi, Imen. “Optimisation heuristique pour la résolution du m-PDPTW statique et dynamique : Heuristics optimization for the resolution of the m-PDPTW static and dynamic.” 2010. Doctoral Dissertation, Ecole centrale de Lille; École nationale d'ingénieurs de Tunis (Tunisie). Accessed February 21, 2020. http://www.theses.fr/2010ECLI0031.

MLA Handbook (7th Edition):

Harbaoui dridi, Imen. “Optimisation heuristique pour la résolution du m-PDPTW statique et dynamique : Heuristics optimization for the resolution of the m-PDPTW static and dynamic.” 2010. Web. 21 Feb 2020.

Vancouver:

Harbaoui dridi I. Optimisation heuristique pour la résolution du m-PDPTW statique et dynamique : Heuristics optimization for the resolution of the m-PDPTW static and dynamic. [Internet] [Doctoral dissertation]. Ecole centrale de Lille; École nationale d'ingénieurs de Tunis (Tunisie); 2010. [cited 2020 Feb 21]. Available from: http://www.theses.fr/2010ECLI0031.

Council of Science Editors:

Harbaoui dridi I. Optimisation heuristique pour la résolution du m-PDPTW statique et dynamique : Heuristics optimization for the resolution of the m-PDPTW static and dynamic. [Doctoral Dissertation]. Ecole centrale de Lille; École nationale d'ingénieurs de Tunis (Tunisie); 2010. Available from: http://www.theses.fr/2010ECLI0031


Texas A&M University

7. Xia, Ge. Parameterized algorithms and computational lower bounds: a structural approach.

Degree: 2006, Texas A&M University

 Many problems of practical significance are known to be NP-hard, and hence, are unlikely to be solved by polynomial-time algorithms. There are several ways to… (more)

Subjects/Keywords: Algorithms; Computational Complexity; Computational Lower Bounds; Parameterized Computation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xia, G. (2006). Parameterized algorithms and computational lower bounds: a structural approach. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/4322

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

Xia, Ge. “Parameterized algorithms and computational lower bounds: a structural approach.” 2006. Thesis, Texas A&M University. Accessed February 21, 2020. http://hdl.handle.net/1969.1/4322.

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

MLA Handbook (7th Edition):

Xia, Ge. “Parameterized algorithms and computational lower bounds: a structural approach.” 2006. Web. 21 Feb 2020.

Vancouver:

Xia G. Parameterized algorithms and computational lower bounds: a structural approach. [Internet] [Thesis]. Texas A&M University; 2006. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/1969.1/4322.

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

Council of Science Editors:

Xia G. Parameterized algorithms and computational lower bounds: a structural approach. [Thesis]. Texas A&M University; 2006. Available from: http://hdl.handle.net/1969.1/4322

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


Texas A&M University

8. Manyam, Satyanarayana Gupta. Routing Vehicles with Motion, Resource and Mission Constraints: Algorithms and Bounds.

Degree: 2015, Texas A&M University

 Unmanned Aerial Vehicles (UAVs) are used for several military and civil applications such as reconnaissance, surveillance etc. The UAVs, due to their design and size… (more)

Subjects/Keywords: Dubins TSP; UAV routing; GPS-denied reouting; Integer programming; NP-Hard problems; Lagrangian relaxation; Lower bounds; discrete optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Manyam, S. G. (2015). Routing Vehicles with Motion, Resource and Mission Constraints: Algorithms and Bounds. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155175

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

Manyam, Satyanarayana Gupta. “Routing Vehicles with Motion, Resource and Mission Constraints: Algorithms and Bounds.” 2015. Thesis, Texas A&M University. Accessed February 21, 2020. http://hdl.handle.net/1969.1/155175.

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

MLA Handbook (7th Edition):

Manyam, Satyanarayana Gupta. “Routing Vehicles with Motion, Resource and Mission Constraints: Algorithms and Bounds.” 2015. Web. 21 Feb 2020.

Vancouver:

Manyam SG. Routing Vehicles with Motion, Resource and Mission Constraints: Algorithms and Bounds. [Internet] [Thesis]. Texas A&M University; 2015. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/1969.1/155175.

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

Council of Science Editors:

Manyam SG. Routing Vehicles with Motion, Resource and Mission Constraints: Algorithms and Bounds. [Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155175

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


Virginia Tech

9. Marmorino, Matthew G. Lower bounds to eigenvalues by the method of arbitrary choice without truncation.

Degree: PhD, Chemistry, 1999, Virginia Tech

 After a detailed discussion of the variation theorem for upper bound calculation of eigenvalues, many standard procedures for determining lower bounds to eigenvalues are presented… (more)

Subjects/Keywords: eigenvalues; variation theorem; hylleraas; united atom; lower bounds

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Marmorino, M. G. (1999). Lower bounds to eigenvalues by the method of arbitrary choice without truncation. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/79725

Chicago Manual of Style (16th Edition):

Marmorino, Matthew G. “Lower bounds to eigenvalues by the method of arbitrary choice without truncation.” 1999. Doctoral Dissertation, Virginia Tech. Accessed February 21, 2020. http://hdl.handle.net/10919/79725.

MLA Handbook (7th Edition):

Marmorino, Matthew G. “Lower bounds to eigenvalues by the method of arbitrary choice without truncation.” 1999. Web. 21 Feb 2020.

Vancouver:

Marmorino MG. Lower bounds to eigenvalues by the method of arbitrary choice without truncation. [Internet] [Doctoral dissertation]. Virginia Tech; 1999. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/10919/79725.

Council of Science Editors:

Marmorino MG. Lower bounds to eigenvalues by the method of arbitrary choice without truncation. [Doctoral Dissertation]. Virginia Tech; 1999. Available from: http://hdl.handle.net/10919/79725

10. Ganesh, Natesh. Physical Information Theoretic Bounds on Energy Costs for Error Correction.

Degree: MS, Electrical & Computer Engineering, 2011, University of Massachusetts

  With diminishing returns in performance with scaling of traditional transistor devices, there is a growing need to understand and improve potential replacements technologies. Sufficient… (more)

Subjects/Keywords: Error Correction; Linear (n; k) code; Heat Dissipation; Generalized Efficacy Measures; Information Loss; Fundamental Lower Bounds; Electrical and Computer Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ganesh, N. (2011). Physical Information Theoretic Bounds on Energy Costs for Error Correction. (Masters Thesis). University of Massachusetts. Retrieved from https://scholarworks.umass.edu/theses/677

Chicago Manual of Style (16th Edition):

Ganesh, Natesh. “Physical Information Theoretic Bounds on Energy Costs for Error Correction.” 2011. Masters Thesis, University of Massachusetts. Accessed February 21, 2020. https://scholarworks.umass.edu/theses/677.

MLA Handbook (7th Edition):

Ganesh, Natesh. “Physical Information Theoretic Bounds on Energy Costs for Error Correction.” 2011. Web. 21 Feb 2020.

Vancouver:

Ganesh N. Physical Information Theoretic Bounds on Energy Costs for Error Correction. [Internet] [Masters thesis]. University of Massachusetts; 2011. [cited 2020 Feb 21]. Available from: https://scholarworks.umass.edu/theses/677.

Council of Science Editors:

Ganesh N. Physical Information Theoretic Bounds on Energy Costs for Error Correction. [Masters Thesis]. University of Massachusetts; 2011. Available from: https://scholarworks.umass.edu/theses/677

11. Baldin, Nikolay. Optimal estimation in high-dimensional and nonparametric models.

Degree: PhD, 2019, University of Cambridge

 Minimax optimality is a key property of an estimation procedure in statistical modelling. This thesis looks at several problems in high-dimensional and nonparametric statistics and… (more)

Subjects/Keywords: Nonparametric statistics; Computational lower bounds; Logistic regression; Link prediction; Volume estimation; Convex hull; UMVU; Stopping set; Exact oracle inequality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Baldin, N. (2019). Optimal estimation in high-dimensional and nonparametric models. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/292864

Chicago Manual of Style (16th Edition):

Baldin, Nikolay. “Optimal estimation in high-dimensional and nonparametric models.” 2019. Doctoral Dissertation, University of Cambridge. Accessed February 21, 2020. https://www.repository.cam.ac.uk/handle/1810/292864.

MLA Handbook (7th Edition):

Baldin, Nikolay. “Optimal estimation in high-dimensional and nonparametric models.” 2019. Web. 21 Feb 2020.

Vancouver:

Baldin N. Optimal estimation in high-dimensional and nonparametric models. [Internet] [Doctoral dissertation]. University of Cambridge; 2019. [cited 2020 Feb 21]. Available from: https://www.repository.cam.ac.uk/handle/1810/292864.

Council of Science Editors:

Baldin N. Optimal estimation in high-dimensional and nonparametric models. [Doctoral Dissertation]. University of Cambridge; 2019. Available from: https://www.repository.cam.ac.uk/handle/1810/292864

12. Kumar, Saptaparni. Fault-Tolerant Distributed Services in Message-Passing Systems.

Degree: PhD, Computer Science, 2019, Texas A&M University

 Distributed systems ranging from small local area networks to large wide area networks like the Internet composed of static and/or mobile users have become increasingly… (more)

Subjects/Keywords: Distributed Computing; Fault tolerance; Lower Bounds; Algorithms

…3.1.5 Lower Bound on Crash-Resilience… …In addition to that, we prove a lower bound on the fraction of correct nodes that is… 

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kumar, S. (2019). Fault-Tolerant Distributed Services in Message-Passing Systems. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/186154

Chicago Manual of Style (16th Edition):

Kumar, Saptaparni. “Fault-Tolerant Distributed Services in Message-Passing Systems.” 2019. Doctoral Dissertation, Texas A&M University. Accessed February 21, 2020. http://hdl.handle.net/1969.1/186154.

MLA Handbook (7th Edition):

Kumar, Saptaparni. “Fault-Tolerant Distributed Services in Message-Passing Systems.” 2019. Web. 21 Feb 2020.

Vancouver:

Kumar S. Fault-Tolerant Distributed Services in Message-Passing Systems. [Internet] [Doctoral dissertation]. Texas A&M University; 2019. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/1969.1/186154.

Council of Science Editors:

Kumar S. Fault-Tolerant Distributed Services in Message-Passing Systems. [Doctoral Dissertation]. Texas A&M University; 2019. Available from: http://hdl.handle.net/1969.1/186154

13. Mohamed Dhib, Cheikh. Etude et résolution de problèmes d'ordonnancement de projets multi-compétences : Intégration à un progiciel intégré libre : Study and resolution methods for multi-skill projects scheduling problems : intégration à un progiciel intégrée libre.

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

Les travaux de cette thèse réalisée sous contrat CIFRE portent sur des problématiques d’ordonnancement de projets mufti-compétences. Définis en collaboration avec des experts de gestion… (more)

Subjects/Keywords: Bornes inférieures; Operations research; Optimization; Project scheduling; Skills; Predictive and reactive; Lower bounds; Mathematical models; Heuristics; Metaheuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mohamed Dhib, C. (2013). Etude et résolution de problèmes d'ordonnancement de projets multi-compétences : Intégration à un progiciel intégré libre : Study and resolution methods for multi-skill projects scheduling problems : intégration à un progiciel intégrée libre. (Doctoral Dissertation). Université François-Rabelais de Tours. Retrieved from http://www.theses.fr/2013TOUR4001

Chicago Manual of Style (16th Edition):

Mohamed Dhib, Cheikh. “Etude et résolution de problèmes d'ordonnancement de projets multi-compétences : Intégration à un progiciel intégré libre : Study and resolution methods for multi-skill projects scheduling problems : intégration à un progiciel intégrée libre.” 2013. Doctoral Dissertation, Université François-Rabelais de Tours. Accessed February 21, 2020. http://www.theses.fr/2013TOUR4001.

MLA Handbook (7th Edition):

Mohamed Dhib, Cheikh. “Etude et résolution de problèmes d'ordonnancement de projets multi-compétences : Intégration à un progiciel intégré libre : Study and resolution methods for multi-skill projects scheduling problems : intégration à un progiciel intégrée libre.” 2013. Web. 21 Feb 2020.

Vancouver:

Mohamed Dhib C. Etude et résolution de problèmes d'ordonnancement de projets multi-compétences : Intégration à un progiciel intégré libre : Study and resolution methods for multi-skill projects scheduling problems : intégration à un progiciel intégrée libre. [Internet] [Doctoral dissertation]. Université François-Rabelais de Tours; 2013. [cited 2020 Feb 21]. Available from: http://www.theses.fr/2013TOUR4001.

Council of Science Editors:

Mohamed Dhib C. Etude et résolution de problèmes d'ordonnancement de projets multi-compétences : Intégration à un progiciel intégré libre : Study and resolution methods for multi-skill projects scheduling problems : intégration à un progiciel intégrée libre. [Doctoral Dissertation]. Université François-Rabelais de Tours; 2013. Available from: http://www.theses.fr/2013TOUR4001


University of Cambridge

14. Baldin, Nikolay. Optimal estimation in high-dimensional and nonparametric models.

Degree: PhD, 2019, University of Cambridge

 Minimax optimality is a key property of an estimation procedure in statistical modelling. This thesis looks at several problems in high-dimensional and nonparametric statistics and… (more)

Subjects/Keywords: Nonparametric statistics; Computational lower bounds; Logistic regression; Link prediction; Volume estimation; Convex hull; UMVU; Stopping set; Exact oracle inequality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Baldin, N. (2019). Optimal estimation in high-dimensional and nonparametric models. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/292864 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.774819

Chicago Manual of Style (16th Edition):

Baldin, Nikolay. “Optimal estimation in high-dimensional and nonparametric models.” 2019. Doctoral Dissertation, University of Cambridge. Accessed February 21, 2020. https://www.repository.cam.ac.uk/handle/1810/292864 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.774819.

MLA Handbook (7th Edition):

Baldin, Nikolay. “Optimal estimation in high-dimensional and nonparametric models.” 2019. Web. 21 Feb 2020.

Vancouver:

Baldin N. Optimal estimation in high-dimensional and nonparametric models. [Internet] [Doctoral dissertation]. University of Cambridge; 2019. [cited 2020 Feb 21]. Available from: https://www.repository.cam.ac.uk/handle/1810/292864 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.774819.

Council of Science Editors:

Baldin N. Optimal estimation in high-dimensional and nonparametric models. [Doctoral Dissertation]. University of Cambridge; 2019. Available from: https://www.repository.cam.ac.uk/handle/1810/292864 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.774819


Queens University

15. Piao, Xiaoxue. State Complexity of Tree Automata .

Degree: Computing, 2012, Queens University

 Modern applications of XML use automata operating on unranked trees. A common definition of tree automata operating on unranked trees uses a set of vertical… (more)

Subjects/Keywords: sequential and parallel concatenation; tree automata; lower bounds; quotient operation; state complexity; projection; determinism and nondeterminism; unranked trees; iterated concatenation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Piao, X. (2012). State Complexity of Tree Automata . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/6937

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

Piao, Xiaoxue. “State Complexity of Tree Automata .” 2012. Thesis, Queens University. Accessed February 21, 2020. http://hdl.handle.net/1974/6937.

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

MLA Handbook (7th Edition):

Piao, Xiaoxue. “State Complexity of Tree Automata .” 2012. Web. 21 Feb 2020.

Vancouver:

Piao X. State Complexity of Tree Automata . [Internet] [Thesis]. Queens University; 2012. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/1974/6937.

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

Council of Science Editors:

Piao X. State Complexity of Tree Automata . [Thesis]. Queens University; 2012. Available from: http://hdl.handle.net/1974/6937

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


Georgia Tech

16. Reed, Jenny Lynn. Theoretical performance bounds for the estimation of drop size distribution and rain rate.

Degree: PhD, Electrical and Computer Engineering, 2016, Georgia Tech

 Radar is an indispensable tool in the observation, analysis, and prediction of weather. The Weather Surveillance Radar 1988-Doppler (WSR-88D) is the primary source of weather… (more)

Subjects/Keywords: Radar; Weather; Meteorology; Drop size distribution; Dual-polarization; Rain rate; Cramer-Rao lower bound; Variance bounds; Maximum likelihood

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Reed, J. L. (2016). Theoretical performance bounds for the estimation of drop size distribution and rain rate. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/56286

Chicago Manual of Style (16th Edition):

Reed, Jenny Lynn. “Theoretical performance bounds for the estimation of drop size distribution and rain rate.” 2016. Doctoral Dissertation, Georgia Tech. Accessed February 21, 2020. http://hdl.handle.net/1853/56286.

MLA Handbook (7th Edition):

Reed, Jenny Lynn. “Theoretical performance bounds for the estimation of drop size distribution and rain rate.” 2016. Web. 21 Feb 2020.

Vancouver:

Reed JL. Theoretical performance bounds for the estimation of drop size distribution and rain rate. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/1853/56286.

Council of Science Editors:

Reed JL. Theoretical performance bounds for the estimation of drop size distribution and rain rate. [Doctoral Dissertation]. Georgia Tech; 2016. Available from: http://hdl.handle.net/1853/56286


Iowa State University

17. Guo, Ge. Solution methods and bounds for two-stage risk-neutral and multistage risk-averse stochastic mixed-integer programs with applications in energy and manufacturing.

Degree: 2018, Iowa State University

 This dissertation presents an integrated method for solving stochastic mixed-integer programs, develops a lower bounding approach for multistage risk-averse stochastic mixed-integer programs, and proposes an… (more)

Subjects/Keywords: dual decomposition; lower bounds; progressive hedging; risk-averse; scenario decomposition; stochastic mixed-integer programming; Industrial Engineering; Operational Research; Statistics and Probability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Guo, G. (2018). Solution methods and bounds for two-stage risk-neutral and multistage risk-averse stochastic mixed-integer programs with applications in energy and manufacturing. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/16364

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

Guo, Ge. “Solution methods and bounds for two-stage risk-neutral and multistage risk-averse stochastic mixed-integer programs with applications in energy and manufacturing.” 2018. Thesis, Iowa State University. Accessed February 21, 2020. https://lib.dr.iastate.edu/etd/16364.

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

MLA Handbook (7th Edition):

Guo, Ge. “Solution methods and bounds for two-stage risk-neutral and multistage risk-averse stochastic mixed-integer programs with applications in energy and manufacturing.” 2018. Web. 21 Feb 2020.

Vancouver:

Guo G. Solution methods and bounds for two-stage risk-neutral and multistage risk-averse stochastic mixed-integer programs with applications in energy and manufacturing. [Internet] [Thesis]. Iowa State University; 2018. [cited 2020 Feb 21]. Available from: https://lib.dr.iastate.edu/etd/16364.

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

Council of Science Editors:

Guo G. Solution methods and bounds for two-stage risk-neutral and multistage risk-averse stochastic mixed-integer programs with applications in energy and manufacturing. [Thesis]. Iowa State University; 2018. Available from: https://lib.dr.iastate.edu/etd/16364

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

18. Grosshans, Nathan. The limits of Nečiporuk's method and the power of programs over monoids taken from small varieties of finite monoids : Les limites de la méthode de Nečiporuk et le pouvoir des programmes sur monoïdes issus de petites variétiés de monoïdes finis.

Degree: Docteur es, Informatique, 2018, Université Paris-Saclay (ComUE); Université de Montréal

 Cette thèse porte sur des minorants pour des mesures de complexité liées à des sous-classes de la classe P de langages pouvant être décidés en… (more)

Subjects/Keywords: Complexité algorithmique; Minorants; Nečiporuk; Programmes sur monoïdes; Da; J; Computational complexity; Lower bounds; Nečiporuk; Programs over monoids; Da; J

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Grosshans, N. (2018). The limits of Nečiporuk's method and the power of programs over monoids taken from small varieties of finite monoids : Les limites de la méthode de Nečiporuk et le pouvoir des programmes sur monoïdes issus de petites variétiés de monoïdes finis. (Doctoral Dissertation). Université Paris-Saclay (ComUE); Université de Montréal. Retrieved from http://www.theses.fr/2018SACLN028

Chicago Manual of Style (16th Edition):

Grosshans, Nathan. “The limits of Nečiporuk's method and the power of programs over monoids taken from small varieties of finite monoids : Les limites de la méthode de Nečiporuk et le pouvoir des programmes sur monoïdes issus de petites variétiés de monoïdes finis.” 2018. Doctoral Dissertation, Université Paris-Saclay (ComUE); Université de Montréal. Accessed February 21, 2020. http://www.theses.fr/2018SACLN028.

MLA Handbook (7th Edition):

Grosshans, Nathan. “The limits of Nečiporuk's method and the power of programs over monoids taken from small varieties of finite monoids : Les limites de la méthode de Nečiporuk et le pouvoir des programmes sur monoïdes issus de petites variétiés de monoïdes finis.” 2018. Web. 21 Feb 2020.

Vancouver:

Grosshans N. The limits of Nečiporuk's method and the power of programs over monoids taken from small varieties of finite monoids : Les limites de la méthode de Nečiporuk et le pouvoir des programmes sur monoïdes issus de petites variétiés de monoïdes finis. [Internet] [Doctoral dissertation]. Université Paris-Saclay (ComUE); Université de Montréal; 2018. [cited 2020 Feb 21]. Available from: http://www.theses.fr/2018SACLN028.

Council of Science Editors:

Grosshans N. The limits of Nečiporuk's method and the power of programs over monoids taken from small varieties of finite monoids : Les limites de la méthode de Nečiporuk et le pouvoir des programmes sur monoïdes issus de petites variétiés de monoïdes finis. [Doctoral Dissertation]. Université Paris-Saclay (ComUE); Université de Montréal; 2018. Available from: http://www.theses.fr/2018SACLN028


University of Helsinki

19. Pekkarinen, Teemu. The lower bounds on nominal interest rates.

Degree: Department of Political and Economic Studies; Helsingfors universitet, Statsvetenskapliga fakulteten, Institutionen för politik och ekonomi, 2017, University of Helsinki

Tämä tutkielma tarkastelee nimelliskorkojen alarajoja muodostaen malleja portfolio-optimointiin riskittömille omaisuuserille. Tutkimus vastaa kysymykseen “onko nimelliskoroilla alaraja ja onko se nolla” teoreettisesti pohtien tilannetta, jossa tallettaja… (more)

Subjects/Keywords: the lower bounds on nominal interest rates; the cash holding costs; the theory of interest; nimelliskorkojen alarajat; käteisen hallussapitokustannukset; korkoteoria; Taloustiede; Economics; Ekonomi; the lower bounds on nominal interest rates; the cash holding costs; the theory of interest; nimelliskorkojen alarajat; käteisen hallussapitokustannukset; korkoteoria

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pekkarinen, T. (2017). The lower bounds on nominal interest rates. (Masters Thesis). University of Helsinki. Retrieved from http://hdl.handle.net/10138/193631

Chicago Manual of Style (16th Edition):

Pekkarinen, Teemu. “The lower bounds on nominal interest rates.” 2017. Masters Thesis, University of Helsinki. Accessed February 21, 2020. http://hdl.handle.net/10138/193631.

MLA Handbook (7th Edition):

Pekkarinen, Teemu. “The lower bounds on nominal interest rates.” 2017. Web. 21 Feb 2020.

Vancouver:

Pekkarinen T. The lower bounds on nominal interest rates. [Internet] [Masters thesis]. University of Helsinki; 2017. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/10138/193631.

Council of Science Editors:

Pekkarinen T. The lower bounds on nominal interest rates. [Masters Thesis]. University of Helsinki; 2017. Available from: http://hdl.handle.net/10138/193631

20. Bacharach, Lucien. Caractérisation des limites fondamentales de l'erreur quadratique moyenne pour l'estimation de signaux comportant des points de rupture : Characterization of mean squared error fundamental limitations in parameter estimation of signals with change-points.

Degree: Docteur es, Traitement du signal et des images, 2018, Université Paris-Saclay (ComUE)

Cette thèse porte sur l'étude des performances d'estimateurs en traitement du signal, et s'attache en particulier à étudier les bornes inférieures de l'erreur quadratique moyenne… (more)

Subjects/Keywords: Bornes de Cramér-Rao; Bornes de Weiss-Weinstein; Estimation de paramètres; Bornes inférieures de l’erreur quadratique moyenne; Maximum de vraisemblance (MV); Maximum a posteriori (MAP); Performances d’estimation asymptotiques et non asymptotiques; Cramér-Rao bounds; Weiss-Weinstein bounds; Parameter estimation; Lower bounds on the mean squared error; Maximum likelihood (ML); Maximum a posteriori (MAP),; Asymptotic and non-asymptotic estimation performance

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bacharach, L. (2018). Caractérisation des limites fondamentales de l'erreur quadratique moyenne pour l'estimation de signaux comportant des points de rupture : Characterization of mean squared error fundamental limitations in parameter estimation of signals with change-points. (Doctoral Dissertation). Université Paris-Saclay (ComUE). Retrieved from http://www.theses.fr/2018SACLS322

Chicago Manual of Style (16th Edition):

Bacharach, Lucien. “Caractérisation des limites fondamentales de l'erreur quadratique moyenne pour l'estimation de signaux comportant des points de rupture : Characterization of mean squared error fundamental limitations in parameter estimation of signals with change-points.” 2018. Doctoral Dissertation, Université Paris-Saclay (ComUE). Accessed February 21, 2020. http://www.theses.fr/2018SACLS322.

MLA Handbook (7th Edition):

Bacharach, Lucien. “Caractérisation des limites fondamentales de l'erreur quadratique moyenne pour l'estimation de signaux comportant des points de rupture : Characterization of mean squared error fundamental limitations in parameter estimation of signals with change-points.” 2018. Web. 21 Feb 2020.

Vancouver:

Bacharach L. Caractérisation des limites fondamentales de l'erreur quadratique moyenne pour l'estimation de signaux comportant des points de rupture : Characterization of mean squared error fundamental limitations in parameter estimation of signals with change-points. [Internet] [Doctoral dissertation]. Université Paris-Saclay (ComUE); 2018. [cited 2020 Feb 21]. Available from: http://www.theses.fr/2018SACLS322.

Council of Science Editors:

Bacharach L. Caractérisation des limites fondamentales de l'erreur quadratique moyenne pour l'estimation de signaux comportant des points de rupture : Characterization of mean squared error fundamental limitations in parameter estimation of signals with change-points. [Doctoral Dissertation]. Université Paris-Saclay (ComUE); 2018. Available from: http://www.theses.fr/2018SACLS322


Kyoto University / 京都大学

21. Nagao, Atsuki. Computational Complexity of Tree Evaluation Problems and Branching Program Satisfiability Problems : 木構造関数値評価問題と分岐プログラム充足性問題に対する計算複雑さ.

Degree: 博士(情報学), 2015, Kyoto University / 京都大学

新制・課程博士

甲第19129号

情博第575号

Subjects/Keywords: Lower Bounds; Branching Programs; Space Complexity; Exponential Time Algorithms; Sorting

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nagao, A. (2015). Computational Complexity of Tree Evaluation Problems and Branching Program Satisfiability Problems : 木構造関数値評価問題と分岐プログラム充足性問題に対する計算複雑さ. (Thesis). Kyoto University / 京都大学. Retrieved from http://hdl.handle.net/2433/199453 ; http://dx.doi.org/10.14989/doctor.k19129

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

Nagao, Atsuki. “Computational Complexity of Tree Evaluation Problems and Branching Program Satisfiability Problems : 木構造関数値評価問題と分岐プログラム充足性問題に対する計算複雑さ.” 2015. Thesis, Kyoto University / 京都大学. Accessed February 21, 2020. http://hdl.handle.net/2433/199453 ; http://dx.doi.org/10.14989/doctor.k19129.

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

MLA Handbook (7th Edition):

Nagao, Atsuki. “Computational Complexity of Tree Evaluation Problems and Branching Program Satisfiability Problems : 木構造関数値評価問題と分岐プログラム充足性問題に対する計算複雑さ.” 2015. Web. 21 Feb 2020.

Vancouver:

Nagao A. Computational Complexity of Tree Evaluation Problems and Branching Program Satisfiability Problems : 木構造関数値評価問題と分岐プログラム充足性問題に対する計算複雑さ. [Internet] [Thesis]. Kyoto University / 京都大学; 2015. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/2433/199453 ; http://dx.doi.org/10.14989/doctor.k19129.

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

Council of Science Editors:

Nagao A. Computational Complexity of Tree Evaluation Problems and Branching Program Satisfiability Problems : 木構造関数値評価問題と分岐プログラム充足性問題に対する計算複雑さ. [Thesis]. Kyoto University / 京都大学; 2015. Available from: http://hdl.handle.net/2433/199453 ; http://dx.doi.org/10.14989/doctor.k19129

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

22. Tamanini, Luca. Analysis and Geometry of RCD spaces via the Schrödinger problem : Analyse et géométrie des espaces RCD par le biais du problème de Schrödinger.

Degree: Docteur es, Mathématiques, 2017, Université Paris X – Nanterre

Le but principal de ce manuscrit est celui de présenter une nouvelle méthode d'interpolation entre des probabilités inspirée du problème de Schrödinger, problème de minimisation… (more)

Subjects/Keywords: Transport optimal; Géométrie métrique; Inégalités fonctionnelles; Problème de Schrödinger; Interpolations entropiques; Courbure de Ricci bornée; Optimal Transport; Schrödinger problem; Metric geometry; Functional inequalities; Entropic interpolations; Ricci lower bounds

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tamanini, L. (2017). Analysis and Geometry of RCD spaces via the Schrödinger problem : Analyse et géométrie des espaces RCD par le biais du problème de Schrödinger. (Doctoral Dissertation). Université Paris X – Nanterre. Retrieved from http://www.theses.fr/2017PA100082

Chicago Manual of Style (16th Edition):

Tamanini, Luca. “Analysis and Geometry of RCD spaces via the Schrödinger problem : Analyse et géométrie des espaces RCD par le biais du problème de Schrödinger.” 2017. Doctoral Dissertation, Université Paris X – Nanterre. Accessed February 21, 2020. http://www.theses.fr/2017PA100082.

MLA Handbook (7th Edition):

Tamanini, Luca. “Analysis and Geometry of RCD spaces via the Schrödinger problem : Analyse et géométrie des espaces RCD par le biais du problème de Schrödinger.” 2017. Web. 21 Feb 2020.

Vancouver:

Tamanini L. Analysis and Geometry of RCD spaces via the Schrödinger problem : Analyse et géométrie des espaces RCD par le biais du problème de Schrödinger. [Internet] [Doctoral dissertation]. Université Paris X – Nanterre; 2017. [cited 2020 Feb 21]. Available from: http://www.theses.fr/2017PA100082.

Council of Science Editors:

Tamanini L. Analysis and Geometry of RCD spaces via the Schrödinger problem : Analyse et géométrie des espaces RCD par le biais du problème de Schrödinger. [Doctoral Dissertation]. Université Paris X – Nanterre; 2017. Available from: http://www.theses.fr/2017PA100082


The Ohio State University

23. Sridhar, Vijay, Sridhar. On the effect of asymmetry and dimension on computational geometric problems.

Degree: PhD, Computer Science and Engineering, 2018, The Ohio State University

 We study two aspects of metric spaces that affect the computational complexity of geometric problems. First, we study directed cut problems and the associated multi-commodity… (more)

Subjects/Keywords: Computer Science; Metric-Embeddings; Quasimetrics; Random-Embeddings; Treewidth; Directed Sparsest-Cut; Directed Multi-Cut; Fractal-Dimension; Exact-Algorithms; Fixed-Parameter-Tractability; Approximation- Schemes; Spanners; Lower-Bounds; Exponential-Time-Hypothesis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sridhar, Vijay, S. (2018). On the effect of asymmetry and dimension on computational geometric problems. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1531362300593304

Chicago Manual of Style (16th Edition):

Sridhar, Vijay, Sridhar. “On the effect of asymmetry and dimension on computational geometric problems.” 2018. Doctoral Dissertation, The Ohio State University. Accessed February 21, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1531362300593304.

MLA Handbook (7th Edition):

Sridhar, Vijay, Sridhar. “On the effect of asymmetry and dimension on computational geometric problems.” 2018. Web. 21 Feb 2020.

Vancouver:

Sridhar, Vijay S. On the effect of asymmetry and dimension on computational geometric problems. [Internet] [Doctoral dissertation]. The Ohio State University; 2018. [cited 2020 Feb 21]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1531362300593304.

Council of Science Editors:

Sridhar, Vijay S. On the effect of asymmetry and dimension on computational geometric problems. [Doctoral Dissertation]. The Ohio State University; 2018. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1531362300593304


The Ohio State University

24. Gilmore, Jason R. Search for Contact Interactions in Deep Inelastic Scattering at Zeus.

Degree: PhD, Physics, 2001, The Ohio State University

  The Neutral and Charged Current Deep Inelastic Scattering cross sections have been measured using 46.7 pb-1 of ZEUS <i>e+p</i> data collected from 1994 through… (more)

Subjects/Keywords: Deep Inelastic Scattering; contact interaction; effective mass scale; ZEUS; limits; lower bounds

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gilmore, J. R. (2001). Search for Contact Interactions in Deep Inelastic Scattering at Zeus. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu983824358

Chicago Manual of Style (16th Edition):

Gilmore, Jason R. “Search for Contact Interactions in Deep Inelastic Scattering at Zeus.” 2001. Doctoral Dissertation, The Ohio State University. Accessed February 21, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu983824358.

MLA Handbook (7th Edition):

Gilmore, Jason R. “Search for Contact Interactions in Deep Inelastic Scattering at Zeus.” 2001. Web. 21 Feb 2020.

Vancouver:

Gilmore JR. Search for Contact Interactions in Deep Inelastic Scattering at Zeus. [Internet] [Doctoral dissertation]. The Ohio State University; 2001. [cited 2020 Feb 21]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu983824358.

Council of Science Editors:

Gilmore JR. Search for Contact Interactions in Deep Inelastic Scattering at Zeus. [Doctoral Dissertation]. The Ohio State University; 2001. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu983824358


Technical University of Lisbon

25. Nunes, Ana Catarina de Carvalho. Sectorização de redes em problemas com procura nos arcos e limitações de capacidade.

Degree: 2009, Technical University of Lisbon

Doutoramento em Matemática Aplicada à Economia e à Gestão

O problema de sectorização e rotas nos arcos (SARP) e definido para modelar as actividades associadas… (more)

Subjects/Keywords: sectorização; problema de rotas com procura nos arcos e restrições de capacidade; grafo misto; formulações; limites inferiores; heurísticas; districting; capacitated arc routing problem; mixed graph; formulations; lower bounds; heuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nunes, A. C. d. C. (2009). Sectorização de redes em problemas com procura nos arcos e limitações de capacidade. (Thesis). Technical University of Lisbon. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/1252

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

Nunes, Ana Catarina de Carvalho. “Sectorização de redes em problemas com procura nos arcos e limitações de capacidade.” 2009. Thesis, Technical University of Lisbon. Accessed February 21, 2020. http://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/1252.

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

MLA Handbook (7th Edition):

Nunes, Ana Catarina de Carvalho. “Sectorização de redes em problemas com procura nos arcos e limitações de capacidade.” 2009. Web. 21 Feb 2020.

Vancouver:

Nunes ACdC. Sectorização de redes em problemas com procura nos arcos e limitações de capacidade. [Internet] [Thesis]. Technical University of Lisbon; 2009. [cited 2020 Feb 21]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/1252.

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

Council of Science Editors:

Nunes ACdC. Sectorização de redes em problemas com procura nos arcos e limitações de capacidade. [Thesis]. Technical University of Lisbon; 2009. Available from: http://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/1252

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


Louisiana State University

26. Sethuraman, Karthik. Mapping weak multidimensional torus communications on optical slab waveguides.

Degree: MSEE, Electrical and Computer Engineering, 2004, Louisiana State University

 This thesis deals with the mapping of communication of a d-dimensional weak torus on an optical medium. Our results are derived in the setting of… (more)

Subjects/Keywords: multidimensional torus; lower bounds; slab waveguides; optical interconnects; interconnection topology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sethuraman, K. (2004). Mapping weak multidimensional torus communications on optical slab waveguides. (Masters Thesis). Louisiana State University. Retrieved from etd-01252005-144734 ; https://digitalcommons.lsu.edu/gradschool_theses/3844

Chicago Manual of Style (16th Edition):

Sethuraman, Karthik. “Mapping weak multidimensional torus communications on optical slab waveguides.” 2004. Masters Thesis, Louisiana State University. Accessed February 21, 2020. etd-01252005-144734 ; https://digitalcommons.lsu.edu/gradschool_theses/3844.

MLA Handbook (7th Edition):

Sethuraman, Karthik. “Mapping weak multidimensional torus communications on optical slab waveguides.” 2004. Web. 21 Feb 2020.

Vancouver:

Sethuraman K. Mapping weak multidimensional torus communications on optical slab waveguides. [Internet] [Masters thesis]. Louisiana State University; 2004. [cited 2020 Feb 21]. Available from: etd-01252005-144734 ; https://digitalcommons.lsu.edu/gradschool_theses/3844.

Council of Science Editors:

Sethuraman K. Mapping weak multidimensional torus communications on optical slab waveguides. [Masters Thesis]. Louisiana State University; 2004. Available from: etd-01252005-144734 ; https://digitalcommons.lsu.edu/gradschool_theses/3844

27. Nagao, Atsuki. Computational Complexity of Tree Evaluation Problems and Branching Program Satisfiability Problems .

Degree: 2015, Kyoto University

Subjects/Keywords: Lower Bounds; Branching Programs; Space Complexity; Exponential Time Algorithms; Sorting

Page 1 Page 2 Page 3

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nagao, A. (2015). Computational Complexity of Tree Evaluation Problems and Branching Program Satisfiability Problems . (Thesis). Kyoto University. Retrieved from http://hdl.handle.net/2433/199453

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

Nagao, Atsuki. “Computational Complexity of Tree Evaluation Problems and Branching Program Satisfiability Problems .” 2015. Thesis, Kyoto University. Accessed February 21, 2020. http://hdl.handle.net/2433/199453.

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

MLA Handbook (7th Edition):

Nagao, Atsuki. “Computational Complexity of Tree Evaluation Problems and Branching Program Satisfiability Problems .” 2015. Web. 21 Feb 2020.

Vancouver:

Nagao A. Computational Complexity of Tree Evaluation Problems and Branching Program Satisfiability Problems . [Internet] [Thesis]. Kyoto University; 2015. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/2433/199453.

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

Council of Science Editors:

Nagao A. Computational Complexity of Tree Evaluation Problems and Branching Program Satisfiability Problems . [Thesis]. Kyoto University; 2015. Available from: http://hdl.handle.net/2433/199453

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

28. Wolle, Thomas. Computational aspects of treewidth : Lower bounds and network reliability.

Degree: 2005, University Utrecht

 Good treewidth lower bounds can be used in branch-and-bound methods. The better and faster the bounds, the faster the branch-and-bound algorithm. They are also useful… (more)

Subjects/Keywords: graphs; treewidth; graphs of bounded treewidth; treewidth lower bounds; network reliability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wolle, T. (2005). Computational aspects of treewidth : Lower bounds and network reliability. (Doctoral Dissertation). University Utrecht. Retrieved from http://dspace.library.uu.nl/handle/1874/3282 ; URN:NBN:NL:UI:10-1874-3282 ; urn:isbn:90-393-3972-4 ; URN:NBN:NL:UI:10-1874-3282 ; http://dspace.library.uu.nl/handle/1874/3282

Chicago Manual of Style (16th Edition):

Wolle, Thomas. “Computational aspects of treewidth : Lower bounds and network reliability.” 2005. Doctoral Dissertation, University Utrecht. Accessed February 21, 2020. http://dspace.library.uu.nl/handle/1874/3282 ; URN:NBN:NL:UI:10-1874-3282 ; urn:isbn:90-393-3972-4 ; URN:NBN:NL:UI:10-1874-3282 ; http://dspace.library.uu.nl/handle/1874/3282.

MLA Handbook (7th Edition):

Wolle, Thomas. “Computational aspects of treewidth : Lower bounds and network reliability.” 2005. Web. 21 Feb 2020.

Vancouver:

Wolle T. Computational aspects of treewidth : Lower bounds and network reliability. [Internet] [Doctoral dissertation]. University Utrecht; 2005. [cited 2020 Feb 21]. Available from: http://dspace.library.uu.nl/handle/1874/3282 ; URN:NBN:NL:UI:10-1874-3282 ; urn:isbn:90-393-3972-4 ; URN:NBN:NL:UI:10-1874-3282 ; http://dspace.library.uu.nl/handle/1874/3282.

Council of Science Editors:

Wolle T. Computational aspects of treewidth : Lower bounds and network reliability. [Doctoral Dissertation]. University Utrecht; 2005. Available from: http://dspace.library.uu.nl/handle/1874/3282 ; URN:NBN:NL:UI:10-1874-3282 ; urn:isbn:90-393-3972-4 ; URN:NBN:NL:UI:10-1874-3282 ; http://dspace.library.uu.nl/handle/1874/3282

29. ANURAG ANSHU. ONE-SHOT PROTOCOLS FOR COMMUNICATION OVER QUANTUM NETWORKS: ACHIEVABILITY AND LIMITATIONS.

Degree: 2018, National University of Singapore

Subjects/Keywords: Quantum Information; Source compression; Channel coding; Entanglement assistance; Expected communication; Lower bounds

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

ANSHU, A. (2018). ONE-SHOT PROTOCOLS FOR COMMUNICATION OVER QUANTUM NETWORKS: ACHIEVABILITY AND LIMITATIONS. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/146923

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

ANSHU, ANURAG. “ONE-SHOT PROTOCOLS FOR COMMUNICATION OVER QUANTUM NETWORKS: ACHIEVABILITY AND LIMITATIONS.” 2018. Thesis, National University of Singapore. Accessed February 21, 2020. http://scholarbank.nus.edu.sg/handle/10635/146923.

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

MLA Handbook (7th Edition):

ANSHU, ANURAG. “ONE-SHOT PROTOCOLS FOR COMMUNICATION OVER QUANTUM NETWORKS: ACHIEVABILITY AND LIMITATIONS.” 2018. Web. 21 Feb 2020.

Vancouver:

ANSHU A. ONE-SHOT PROTOCOLS FOR COMMUNICATION OVER QUANTUM NETWORKS: ACHIEVABILITY AND LIMITATIONS. [Internet] [Thesis]. National University of Singapore; 2018. [cited 2020 Feb 21]. Available from: http://scholarbank.nus.edu.sg/handle/10635/146923.

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

Council of Science Editors:

ANSHU A. ONE-SHOT PROTOCOLS FOR COMMUNICATION OVER QUANTUM NETWORKS: ACHIEVABILITY AND LIMITATIONS. [Thesis]. National University of Singapore; 2018. Available from: http://scholarbank.nus.edu.sg/handle/10635/146923

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


Brno University of Technology

30. Liška, Ondřej. Kvadratický přiřazovací problém – reformulace a dolní meze .

Degree: 2019, Brno University of Technology

 Tato práce se zabývá kvadratickým přiřazovacím problémem. První část představuje přiřazovací problémy včetně základní aplikace. Po vymezení problematiky a základní konvence značení jsou popsány zvolené… (more)

Subjects/Keywords: Optimalizace; kvadratický přiřazovací problém; reformulace; linearizace; dolní meze; jazyk Julia; Gurobi; Optimization; quadratic assignment problem; reformulations; linearization; lower bounds; Julia Language; Gurobi

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liška, O. (2019). Kvadratický přiřazovací problém – reformulace a dolní meze . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/179361

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

Liška, Ondřej. “Kvadratický přiřazovací problém – reformulace a dolní meze .” 2019. Thesis, Brno University of Technology. Accessed February 21, 2020. http://hdl.handle.net/11012/179361.

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

MLA Handbook (7th Edition):

Liška, Ondřej. “Kvadratický přiřazovací problém – reformulace a dolní meze .” 2019. Web. 21 Feb 2020.

Vancouver:

Liška O. Kvadratický přiřazovací problém – reformulace a dolní meze . [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/11012/179361.

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

Council of Science Editors:

Liška O. Kvadratický přiřazovací problém – reformulace a dolní meze . [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/179361

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

[1] [2]

.