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

[1] [2] [3] [4]

Search Limiters

Last 2 Years | English Only

Department

Degrees

Languages

Country

▼ Search Limiters


University of Kansas

1. Duna, Chad Kenneth. Matroid Independence Polytopes and Their Ehrhart Theory.

Degree: PhD, Mathematics, 2019, University of Kansas

 A \emph{matroid} is a combinatorial structure that provides an abstract and flexible model for dependence relations between elements of a set. One way of studying… (more)

Subjects/Keywords: Mathematics; Combinatorics; Ehrhart; Matroid; Polytope

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Duna, C. K. (2019). Matroid Independence Polytopes and Their Ehrhart Theory. (Doctoral Dissertation). University of Kansas. Retrieved from http://hdl.handle.net/1808/29877

Chicago Manual of Style (16th Edition):

Duna, Chad Kenneth. “Matroid Independence Polytopes and Their Ehrhart Theory.” 2019. Doctoral Dissertation, University of Kansas. Accessed August 05, 2020. http://hdl.handle.net/1808/29877.

MLA Handbook (7th Edition):

Duna, Chad Kenneth. “Matroid Independence Polytopes and Their Ehrhart Theory.” 2019. Web. 05 Aug 2020.

Vancouver:

Duna CK. Matroid Independence Polytopes and Their Ehrhart Theory. [Internet] [Doctoral dissertation]. University of Kansas; 2019. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/1808/29877.

Council of Science Editors:

Duna CK. Matroid Independence Polytopes and Their Ehrhart Theory. [Doctoral Dissertation]. University of Kansas; 2019. Available from: http://hdl.handle.net/1808/29877


Northeastern University

2. Cunningham, Gabe. Internal and external invariance of abstract polytopes.

Degree: PhD, Department of Mathematics, 2012, Northeastern University

 In addition to the usual symmetries by reflections and rotations, abstract polytopes can have external symmetries such as self-duality and self-Petriality. In this dissertation, we… (more)

Subjects/Keywords: chiral polytope; discrete geometry; duality; polytope; regular polytope; Discrete Mathematics and Combinatorics; Geometry and Topology; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cunningham, G. (2012). Internal and external invariance of abstract polytopes. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/d20002986

Chicago Manual of Style (16th Edition):

Cunningham, Gabe. “Internal and external invariance of abstract polytopes.” 2012. Doctoral Dissertation, Northeastern University. Accessed August 05, 2020. http://hdl.handle.net/2047/d20002986.

MLA Handbook (7th Edition):

Cunningham, Gabe. “Internal and external invariance of abstract polytopes.” 2012. Web. 05 Aug 2020.

Vancouver:

Cunningham G. Internal and external invariance of abstract polytopes. [Internet] [Doctoral dissertation]. Northeastern University; 2012. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/2047/d20002986.

Council of Science Editors:

Cunningham G. Internal and external invariance of abstract polytopes. [Doctoral Dissertation]. Northeastern University; 2012. Available from: http://hdl.handle.net/2047/d20002986


Université du Québec à Montréal

3. Lortie, Jonathan. Approche combinatoire du permutoèdre et de l'associaèdre.

Degree: 2011, Université du Québec à Montréal

 Dans ce mémoire nous allons définir l'associaèdre et voir différentes manières de construire ses réalisations. Nous allons premièrement voir la réalisation donnée par Jean-Louis Loday… (more)

Subjects/Keywords: Associaèdre; Nombres de Catalan; Permutoèdre; Polytope abstrait

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lortie, J. (2011). Approche combinatoire du permutoèdre et de l'associaèdre. (Thesis). Université du Québec à Montréal. Retrieved from http://www.archipel.uqam.ca/4212/1/M12051.pdf

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

Lortie, Jonathan. “Approche combinatoire du permutoèdre et de l'associaèdre.” 2011. Thesis, Université du Québec à Montréal. Accessed August 05, 2020. http://www.archipel.uqam.ca/4212/1/M12051.pdf.

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

MLA Handbook (7th Edition):

Lortie, Jonathan. “Approche combinatoire du permutoèdre et de l'associaèdre.” 2011. Web. 05 Aug 2020.

Vancouver:

Lortie J. Approche combinatoire du permutoèdre et de l'associaèdre. [Internet] [Thesis]. Université du Québec à Montréal; 2011. [cited 2020 Aug 05]. Available from: http://www.archipel.uqam.ca/4212/1/M12051.pdf.

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

Council of Science Editors:

Lortie J. Approche combinatoire du permutoèdre et de l'associaèdre. [Thesis]. Université du Québec à Montréal; 2011. Available from: http://www.archipel.uqam.ca/4212/1/M12051.pdf

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


University of California – Berkeley

4. Doker, Jeffrey Samuel. Geometry of Generalized Permutohedra.

Degree: Mathematics, 2011, University of California – Berkeley

 We study generalized permutohedra and some of the geometric properties they exhibit. We decompose matroid polytopes (and several related polytopes) into signed Minkowski sums of… (more)

Subjects/Keywords: Mathematics; associahedron; generalized permutohedron; matroid; multiplihedron; polytope

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Doker, J. S. (2011). Geometry of Generalized Permutohedra. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/34p6s66v

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

Doker, Jeffrey Samuel. “Geometry of Generalized Permutohedra.” 2011. Thesis, University of California – Berkeley. Accessed August 05, 2020. http://www.escholarship.org/uc/item/34p6s66v.

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

MLA Handbook (7th Edition):

Doker, Jeffrey Samuel. “Geometry of Generalized Permutohedra.” 2011. Web. 05 Aug 2020.

Vancouver:

Doker JS. Geometry of Generalized Permutohedra. [Internet] [Thesis]. University of California – Berkeley; 2011. [cited 2020 Aug 05]. Available from: http://www.escholarship.org/uc/item/34p6s66v.

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

Council of Science Editors:

Doker JS. Geometry of Generalized Permutohedra. [Thesis]. University of California – Berkeley; 2011. Available from: http://www.escholarship.org/uc/item/34p6s66v

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


University of California – Berkeley

5. Kalman, Adam Michael. Newton Polytopes of Cluster Variables.

Degree: Mathematics, 2014, University of California – Berkeley

 We study Newton polytopes of cluster variables in type A cluster algebras, whose cluster and coefficient variables are indexed by the diagonals and boundary segments… (more)

Subjects/Keywords: Mathematics; cluster algebra; Newton polytope; triangulated surface

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kalman, A. M. (2014). Newton Polytopes of Cluster Variables. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/39s8s0q1

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

Kalman, Adam Michael. “Newton Polytopes of Cluster Variables.” 2014. Thesis, University of California – Berkeley. Accessed August 05, 2020. http://www.escholarship.org/uc/item/39s8s0q1.

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

MLA Handbook (7th Edition):

Kalman, Adam Michael. “Newton Polytopes of Cluster Variables.” 2014. Web. 05 Aug 2020.

Vancouver:

Kalman AM. Newton Polytopes of Cluster Variables. [Internet] [Thesis]. University of California – Berkeley; 2014. [cited 2020 Aug 05]. Available from: http://www.escholarship.org/uc/item/39s8s0q1.

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

Council of Science Editors:

Kalman AM. Newton Polytopes of Cluster Variables. [Thesis]. University of California – Berkeley; 2014. Available from: http://www.escholarship.org/uc/item/39s8s0q1

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


Université du Québec à Montréal

6. Lortie, Jonathan. Approche combinatoire du permutoèdre et de l'associaèdre.

Degree: 2011, Université du Québec à Montréal

 Dans ce mémoire nous allons définir l'associaèdre et voir différentes manières de construire ses réalisations. Nous allons premièrement voir la réalisation donnée par Jean-Louis Loday… (more)

Subjects/Keywords: Associaèdre; Nombres de Catalan; Permutoèdre; Polytope abstrait

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lortie, J. (2011). Approche combinatoire du permutoèdre et de l'associaèdre. (Thesis). Université du Québec à Montréal. Retrieved from http://archipel.uqam.ca/4212/1/M12051.pdf

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

Lortie, Jonathan. “Approche combinatoire du permutoèdre et de l'associaèdre.” 2011. Thesis, Université du Québec à Montréal. Accessed August 05, 2020. http://archipel.uqam.ca/4212/1/M12051.pdf.

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

MLA Handbook (7th Edition):

Lortie, Jonathan. “Approche combinatoire du permutoèdre et de l'associaèdre.” 2011. Web. 05 Aug 2020.

Vancouver:

Lortie J. Approche combinatoire du permutoèdre et de l'associaèdre. [Internet] [Thesis]. Université du Québec à Montréal; 2011. [cited 2020 Aug 05]. Available from: http://archipel.uqam.ca/4212/1/M12051.pdf.

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

Council of Science Editors:

Lortie J. Approche combinatoire du permutoèdre et de l'associaèdre. [Thesis]. Université du Québec à Montréal; 2011. Available from: http://archipel.uqam.ca/4212/1/M12051.pdf

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


University of Kansas

7. Espenschied, William Joshua. Graphs of Polytopes.

Degree: PhD, Mathematics, 2014, University of Kansas

 The graph of a polytope is the graph whose vertex set is the set of vertices of the polytope, and whose edge set is the… (more)

Subjects/Keywords: Mathematics; Anticlique; Gale diagram; Graph; Polytope

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Espenschied, W. J. (2014). Graphs of Polytopes. (Doctoral Dissertation). University of Kansas. Retrieved from http://hdl.handle.net/1808/18668

Chicago Manual of Style (16th Edition):

Espenschied, William Joshua. “Graphs of Polytopes.” 2014. Doctoral Dissertation, University of Kansas. Accessed August 05, 2020. http://hdl.handle.net/1808/18668.

MLA Handbook (7th Edition):

Espenschied, William Joshua. “Graphs of Polytopes.” 2014. Web. 05 Aug 2020.

Vancouver:

Espenschied WJ. Graphs of Polytopes. [Internet] [Doctoral dissertation]. University of Kansas; 2014. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/1808/18668.

Council of Science Editors:

Espenschied WJ. Graphs of Polytopes. [Doctoral Dissertation]. University of Kansas; 2014. Available from: http://hdl.handle.net/1808/18668


UCLA

8. Enciso, Michael. Manifesting Hidden Structure in Scattering Amplitudes.

Degree: Physics, 2019, UCLA

 This dissertation explores hidden structure within scattering amplitudes in quantum field theory, both at tree-level and at loop-level, and introduces some novel methods for making… (more)

Subjects/Keywords: Theoretical physics; Particle physics; Amplitudes; Polytope; Scattering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Enciso, M. (2019). Manifesting Hidden Structure in Scattering Amplitudes. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/06x6s0b0

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

Enciso, Michael. “Manifesting Hidden Structure in Scattering Amplitudes.” 2019. Thesis, UCLA. Accessed August 05, 2020. http://www.escholarship.org/uc/item/06x6s0b0.

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

MLA Handbook (7th Edition):

Enciso, Michael. “Manifesting Hidden Structure in Scattering Amplitudes.” 2019. Web. 05 Aug 2020.

Vancouver:

Enciso M. Manifesting Hidden Structure in Scattering Amplitudes. [Internet] [Thesis]. UCLA; 2019. [cited 2020 Aug 05]. Available from: http://www.escholarship.org/uc/item/06x6s0b0.

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

Council of Science Editors:

Enciso M. Manifesting Hidden Structure in Scattering Amplitudes. [Thesis]. UCLA; 2019. Available from: http://www.escholarship.org/uc/item/06x6s0b0

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


University of Minnesota

9. Edman, Robert. Diameter and Coherence of Monotone Path Graph.

Degree: PhD, Mathematics, 2015, University of Minnesota

 A Zonotope Z is the linear projection of an n-cube into ℝd. Given a generic linear function f, an f-monotone path on Z is a… (more)

Subjects/Keywords: fiber polytope; hyperplane arrangements; monotone paths

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Edman, R. (2015). Diameter and Coherence of Monotone Path Graph. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/175426

Chicago Manual of Style (16th Edition):

Edman, Robert. “Diameter and Coherence of Monotone Path Graph.” 2015. Doctoral Dissertation, University of Minnesota. Accessed August 05, 2020. http://hdl.handle.net/11299/175426.

MLA Handbook (7th Edition):

Edman, Robert. “Diameter and Coherence of Monotone Path Graph.” 2015. Web. 05 Aug 2020.

Vancouver:

Edman R. Diameter and Coherence of Monotone Path Graph. [Internet] [Doctoral dissertation]. University of Minnesota; 2015. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/11299/175426.

Council of Science Editors:

Edman R. Diameter and Coherence of Monotone Path Graph. [Doctoral Dissertation]. University of Minnesota; 2015. Available from: http://hdl.handle.net/11299/175426

10. Manneville, Thibault. Geometrical and combinatorial generalizations of the associahedron : Généralisations géométriques et combinatoires de l'associaèdre.

Degree: Docteur es, Mathématiques et Informatique, 2017, Université Paris-Saclay (ComUE)

L'associaèdre se situe à l'interface de plusieurs domaines mathématiques. Combinatoirement, il s'agit du complexe simplicial des dissections d'un polygone convexe (ensembles de diagonales ne se… (more)

Subjects/Keywords: Associaèdre; Éventail; Algèbres amassées; Graphe; Polytope; Triangulation; Associahedron; Fan; Cluster algebras; Graph; Polytope; Triangulation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Manneville, T. (2017). Geometrical and combinatorial generalizations of the associahedron : Généralisations géométriques et combinatoires de l'associaèdre. (Doctoral Dissertation). Université Paris-Saclay (ComUE). Retrieved from http://www.theses.fr/2017SACLX019

Chicago Manual of Style (16th Edition):

Manneville, Thibault. “Geometrical and combinatorial generalizations of the associahedron : Généralisations géométriques et combinatoires de l'associaèdre.” 2017. Doctoral Dissertation, Université Paris-Saclay (ComUE). Accessed August 05, 2020. http://www.theses.fr/2017SACLX019.

MLA Handbook (7th Edition):

Manneville, Thibault. “Geometrical and combinatorial generalizations of the associahedron : Généralisations géométriques et combinatoires de l'associaèdre.” 2017. Web. 05 Aug 2020.

Vancouver:

Manneville T. Geometrical and combinatorial generalizations of the associahedron : Généralisations géométriques et combinatoires de l'associaèdre. [Internet] [Doctoral dissertation]. Université Paris-Saclay (ComUE); 2017. [cited 2020 Aug 05]. Available from: http://www.theses.fr/2017SACLX019.

Council of Science Editors:

Manneville T. Geometrical and combinatorial generalizations of the associahedron : Généralisations géométriques et combinatoires de l'associaèdre. [Doctoral Dissertation]. Université Paris-Saclay (ComUE); 2017. Available from: http://www.theses.fr/2017SACLX019

11. Brunel, Victor Emmanuel. Non parametric estimation of convex bodies and convex polytopes : Estimation non paramétrique d'ensembles et de polytopes convexes.

Degree: Docteur es, Mathématiques et applications, 2014, Université Pierre et Marie Curie – Paris VI

Dans ce travail, nous nous intéressons à l'estimation d'ensembles convexes dans l'espace Euclidien \Rd, en nous penchant sur deux modèles. Dans le premier modèle, nous… (more)

Subjects/Keywords: Convexité; Détection; Estimation non paramétrique; Polytope; Support de densité; Régression; Regression; Polytope; 510

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brunel, V. E. (2014). Non parametric estimation of convex bodies and convex polytopes : Estimation non paramétrique d'ensembles et de polytopes convexes. (Doctoral Dissertation). Université Pierre et Marie Curie – Paris VI. Retrieved from http://www.theses.fr/2014PA066146

Chicago Manual of Style (16th Edition):

Brunel, Victor Emmanuel. “Non parametric estimation of convex bodies and convex polytopes : Estimation non paramétrique d'ensembles et de polytopes convexes.” 2014. Doctoral Dissertation, Université Pierre et Marie Curie – Paris VI. Accessed August 05, 2020. http://www.theses.fr/2014PA066146.

MLA Handbook (7th Edition):

Brunel, Victor Emmanuel. “Non parametric estimation of convex bodies and convex polytopes : Estimation non paramétrique d'ensembles et de polytopes convexes.” 2014. Web. 05 Aug 2020.

Vancouver:

Brunel VE. Non parametric estimation of convex bodies and convex polytopes : Estimation non paramétrique d'ensembles et de polytopes convexes. [Internet] [Doctoral dissertation]. Université Pierre et Marie Curie – Paris VI; 2014. [cited 2020 Aug 05]. Available from: http://www.theses.fr/2014PA066146.

Council of Science Editors:

Brunel VE. Non parametric estimation of convex bodies and convex polytopes : Estimation non paramétrique d'ensembles et de polytopes convexes. [Doctoral Dissertation]. Université Pierre et Marie Curie – Paris VI; 2014. Available from: http://www.theses.fr/2014PA066146

12. Homri, Lazhar. Stratégies de mise en oeuvre des polytopes en analyse de tolérance : STRATEGIES OF POLYTOPES IMPLEMENTATION IN TOLERANCE ANALYSIS.

Degree: Docteur es, Mécanique, 2014, Bordeaux

En analyse de tolérances géométriques, une approche consiste à manipuler des polyèdres de R' issus d’ensembles de contraintes linéaires. La position relative entre deux surfaces… (more)

Subjects/Keywords: Analyse de tolérances; Intersections; Somme de Minkowski; Polytope; Polyèdre; Géométrie algorithmique; Tolerance analysis; Computational geometry; Polyhedron; Polytope; Minkowski sum; Intersections

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Homri, L. (2014). Stratégies de mise en oeuvre des polytopes en analyse de tolérance : STRATEGIES OF POLYTOPES IMPLEMENTATION IN TOLERANCE ANALYSIS. (Doctoral Dissertation). Bordeaux. Retrieved from http://www.theses.fr/2014BORD0156

Chicago Manual of Style (16th Edition):

Homri, Lazhar. “Stratégies de mise en oeuvre des polytopes en analyse de tolérance : STRATEGIES OF POLYTOPES IMPLEMENTATION IN TOLERANCE ANALYSIS.” 2014. Doctoral Dissertation, Bordeaux. Accessed August 05, 2020. http://www.theses.fr/2014BORD0156.

MLA Handbook (7th Edition):

Homri, Lazhar. “Stratégies de mise en oeuvre des polytopes en analyse de tolérance : STRATEGIES OF POLYTOPES IMPLEMENTATION IN TOLERANCE ANALYSIS.” 2014. Web. 05 Aug 2020.

Vancouver:

Homri L. Stratégies de mise en oeuvre des polytopes en analyse de tolérance : STRATEGIES OF POLYTOPES IMPLEMENTATION IN TOLERANCE ANALYSIS. [Internet] [Doctoral dissertation]. Bordeaux; 2014. [cited 2020 Aug 05]. Available from: http://www.theses.fr/2014BORD0156.

Council of Science Editors:

Homri L. Stratégies de mise en oeuvre des polytopes en analyse de tolérance : STRATEGIES OF POLYTOPES IMPLEMENTATION IN TOLERANCE ANALYSIS. [Doctoral Dissertation]. Bordeaux; 2014. Available from: http://www.theses.fr/2014BORD0156


Université du Québec à Montréal

13. Painchaud, Gabriel. Les orbifolds toriques et la formule de Guillemin.

Degree: 2007, Université du Québec à Montréal

 Dans la première partie de ce mémoire nous introduisons toute la théorie nécessaire à une bonne compréhension de la théorie des variétés et orbifolds toriques.… (more)

Subjects/Keywords: Orbifold; Variété kählérienne; Polytope

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Painchaud, G. (2007). Les orbifolds toriques et la formule de Guillemin. (Thesis). Université du Québec à Montréal. Retrieved from http://www.archipel.uqam.ca/3119/1/M9689.pdf

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

Painchaud, Gabriel. “Les orbifolds toriques et la formule de Guillemin.” 2007. Thesis, Université du Québec à Montréal. Accessed August 05, 2020. http://www.archipel.uqam.ca/3119/1/M9689.pdf.

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

MLA Handbook (7th Edition):

Painchaud, Gabriel. “Les orbifolds toriques et la formule de Guillemin.” 2007. Web. 05 Aug 2020.

Vancouver:

Painchaud G. Les orbifolds toriques et la formule de Guillemin. [Internet] [Thesis]. Université du Québec à Montréal; 2007. [cited 2020 Aug 05]. Available from: http://www.archipel.uqam.ca/3119/1/M9689.pdf.

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

Council of Science Editors:

Painchaud G. Les orbifolds toriques et la formule de Guillemin. [Thesis]. Université du Québec à Montréal; 2007. Available from: http://www.archipel.uqam.ca/3119/1/M9689.pdf

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


Université du Québec à Montréal

14. Painchaud, Gabriel. Les orbifolds toriques et la formule de Guillemin.

Degree: 2007, Université du Québec à Montréal

 Dans la première partie de ce mémoire nous introduisons toute la théorie nécessaire à une bonne compréhension de la théorie des variétés et orbifolds toriques.… (more)

Subjects/Keywords: Orbifold; Variété kählérienne; Polytope

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Painchaud, G. (2007). Les orbifolds toriques et la formule de Guillemin. (Thesis). Université du Québec à Montréal. Retrieved from http://archipel.uqam.ca/3119/1/M9689.pdf

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

Painchaud, Gabriel. “Les orbifolds toriques et la formule de Guillemin.” 2007. Thesis, Université du Québec à Montréal. Accessed August 05, 2020. http://archipel.uqam.ca/3119/1/M9689.pdf.

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

MLA Handbook (7th Edition):

Painchaud, Gabriel. “Les orbifolds toriques et la formule de Guillemin.” 2007. Web. 05 Aug 2020.

Vancouver:

Painchaud G. Les orbifolds toriques et la formule de Guillemin. [Internet] [Thesis]. Université du Québec à Montréal; 2007. [cited 2020 Aug 05]. Available from: http://archipel.uqam.ca/3119/1/M9689.pdf.

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

Council of Science Editors:

Painchaud G. Les orbifolds toriques et la formule de Guillemin. [Thesis]. Université du Québec à Montréal; 2007. Available from: http://archipel.uqam.ca/3119/1/M9689.pdf

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


Wayne State University

15. Forouzmand, Elmirasadat. The Rna Newton Polytope And Learnability Of Energy Parameters.

Degree: MS, Computer Science, 2014, Wayne State University

  Computational RNA secondary structure prediction has been a topic of much research interest for several decades now. Despite all the progress made in the… (more)

Subjects/Keywords: Bioinformatics; Newton Polytope; RNA structure prediction; Bioinformatics; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Forouzmand, E. (2014). The Rna Newton Polytope And Learnability Of Energy Parameters. (Masters Thesis). Wayne State University. Retrieved from https://digitalcommons.wayne.edu/oa_theses/329

Chicago Manual of Style (16th Edition):

Forouzmand, Elmirasadat. “The Rna Newton Polytope And Learnability Of Energy Parameters.” 2014. Masters Thesis, Wayne State University. Accessed August 05, 2020. https://digitalcommons.wayne.edu/oa_theses/329.

MLA Handbook (7th Edition):

Forouzmand, Elmirasadat. “The Rna Newton Polytope And Learnability Of Energy Parameters.” 2014. Web. 05 Aug 2020.

Vancouver:

Forouzmand E. The Rna Newton Polytope And Learnability Of Energy Parameters. [Internet] [Masters thesis]. Wayne State University; 2014. [cited 2020 Aug 05]. Available from: https://digitalcommons.wayne.edu/oa_theses/329.

Council of Science Editors:

Forouzmand E. The Rna Newton Polytope And Learnability Of Energy Parameters. [Masters Thesis]. Wayne State University; 2014. Available from: https://digitalcommons.wayne.edu/oa_theses/329


RMIT University

16. Sang, T. Geometry in structured optimisation problems.

Degree: 2018, RMIT University

 In this thesis, we start by providing some background knowledge on importance of convex analysis. Then, we will be looking at the Demyanov-Ryabova conjecture. This… (more)

Subjects/Keywords: Fields of Research; Optimization; Demyanov-Ryabova; Subdifferential; Convex analysis; Polytope

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sang, T. (2018). Geometry in structured optimisation problems. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:162659

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

Sang, T. “Geometry in structured optimisation problems.” 2018. Thesis, RMIT University. Accessed August 05, 2020. http://researchbank.rmit.edu.au/view/rmit:162659.

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

MLA Handbook (7th Edition):

Sang, T. “Geometry in structured optimisation problems.” 2018. Web. 05 Aug 2020.

Vancouver:

Sang T. Geometry in structured optimisation problems. [Internet] [Thesis]. RMIT University; 2018. [cited 2020 Aug 05]. Available from: http://researchbank.rmit.edu.au/view/rmit:162659.

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

Council of Science Editors:

Sang T. Geometry in structured optimisation problems. [Thesis]. RMIT University; 2018. Available from: http://researchbank.rmit.edu.au/view/rmit:162659

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


University of Oxford

17. Schaich, Rainer Manuel. Robust model predictive control.

Degree: PhD, 2017, University of Oxford

 This thesis deals with the topic of min-max formulations of robust model predictive control problems. The sets involved in guaranteeing robust feasibility of the min-max… (more)

Subjects/Keywords: Robust Control; Polytope Operation; Parametric Convexity; Set-Valued Map

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schaich, R. M. (2017). Robust model predictive control. (Doctoral Dissertation). University of Oxford. Retrieved from https://ora.ox.ac.uk/objects/uuid:94e75a62-a801-47e1-8cb8-668e8309d477 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.740904

Chicago Manual of Style (16th Edition):

Schaich, Rainer Manuel. “Robust model predictive control.” 2017. Doctoral Dissertation, University of Oxford. Accessed August 05, 2020. https://ora.ox.ac.uk/objects/uuid:94e75a62-a801-47e1-8cb8-668e8309d477 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.740904.

MLA Handbook (7th Edition):

Schaich, Rainer Manuel. “Robust model predictive control.” 2017. Web. 05 Aug 2020.

Vancouver:

Schaich RM. Robust model predictive control. [Internet] [Doctoral dissertation]. University of Oxford; 2017. [cited 2020 Aug 05]. Available from: https://ora.ox.ac.uk/objects/uuid:94e75a62-a801-47e1-8cb8-668e8309d477 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.740904.

Council of Science Editors:

Schaich RM. Robust model predictive control. [Doctoral Dissertation]. University of Oxford; 2017. Available from: https://ora.ox.ac.uk/objects/uuid:94e75a62-a801-47e1-8cb8-668e8309d477 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.740904

18. Wilfong, Andrew. TORIC VARIETIES AND COBORDISM.

Degree: 2013, University of Kentucky

 A long-standing problem in cobordism theory has been to find convenient manifolds to represent cobordism classes. For example, in the late 1950's, Hirzebruch asked which… (more)

Subjects/Keywords: toric variety; cobordism; fan; polytope; blow-up; Geometry and Topology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wilfong, A. (2013). TORIC VARIETIES AND COBORDISM. (Doctoral Dissertation). University of Kentucky. Retrieved from https://uknowledge.uky.edu/math_etds/8

Chicago Manual of Style (16th Edition):

Wilfong, Andrew. “TORIC VARIETIES AND COBORDISM.” 2013. Doctoral Dissertation, University of Kentucky. Accessed August 05, 2020. https://uknowledge.uky.edu/math_etds/8.

MLA Handbook (7th Edition):

Wilfong, Andrew. “TORIC VARIETIES AND COBORDISM.” 2013. Web. 05 Aug 2020.

Vancouver:

Wilfong A. TORIC VARIETIES AND COBORDISM. [Internet] [Doctoral dissertation]. University of Kentucky; 2013. [cited 2020 Aug 05]. Available from: https://uknowledge.uky.edu/math_etds/8.

Council of Science Editors:

Wilfong A. TORIC VARIETIES AND COBORDISM. [Doctoral Dissertation]. University of Kentucky; 2013. Available from: https://uknowledge.uky.edu/math_etds/8


Northeastern University

19. Altman, Ross. Systematic phenomenology on the landscape of Calabi-Yau hypersurfaces in toric varieties.

Degree: PhD, Department of Physics, 2017, Northeastern University

 The largest known database of Calabi-Yau threefold string vacua was famously produced by Kreuzer and Skarke in the form of a complete construction of all… (more)

Subjects/Keywords: Calabi-Yau; orientifold; reflexive polytope; string vacuum; Swiss cheese; toric variety

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Altman, R. (2017). Systematic phenomenology on the landscape of Calabi-Yau hypersurfaces in toric varieties. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20248609

Chicago Manual of Style (16th Edition):

Altman, Ross. “Systematic phenomenology on the landscape of Calabi-Yau hypersurfaces in toric varieties.” 2017. Doctoral Dissertation, Northeastern University. Accessed August 05, 2020. http://hdl.handle.net/2047/D20248609.

MLA Handbook (7th Edition):

Altman, Ross. “Systematic phenomenology on the landscape of Calabi-Yau hypersurfaces in toric varieties.” 2017. Web. 05 Aug 2020.

Vancouver:

Altman R. Systematic phenomenology on the landscape of Calabi-Yau hypersurfaces in toric varieties. [Internet] [Doctoral dissertation]. Northeastern University; 2017. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/2047/D20248609.

Council of Science Editors:

Altman R. Systematic phenomenology on the landscape of Calabi-Yau hypersurfaces in toric varieties. [Doctoral Dissertation]. Northeastern University; 2017. Available from: http://hdl.handle.net/2047/D20248609

20. Manoussakis, Georgios Oreste. Algorithmes combinatoires et Optimisation : Combinatorial Algorithms and Optimization.

Degree: Docteur es, Informatique, 2017, Université Paris-Saclay (ComUE)

Nous introduisons d'abord la classe des graphes k-dégénérés qui est souvent utilisée pour modéliser des grands graphes épars issus du monde réel. Nous proposons de… (more)

Subjects/Keywords: Algorithmique; Graphes; Énumération; Diamètre; Polytope; Algorithmics; Graphs; Enumeration; Diameter; Polytopes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Manoussakis, G. O. (2017). Algorithmes combinatoires et Optimisation : Combinatorial Algorithms and Optimization. (Doctoral Dissertation). Université Paris-Saclay (ComUE). Retrieved from http://www.theses.fr/2017SACLS517

Chicago Manual of Style (16th Edition):

Manoussakis, Georgios Oreste. “Algorithmes combinatoires et Optimisation : Combinatorial Algorithms and Optimization.” 2017. Doctoral Dissertation, Université Paris-Saclay (ComUE). Accessed August 05, 2020. http://www.theses.fr/2017SACLS517.

MLA Handbook (7th Edition):

Manoussakis, Georgios Oreste. “Algorithmes combinatoires et Optimisation : Combinatorial Algorithms and Optimization.” 2017. Web. 05 Aug 2020.

Vancouver:

Manoussakis GO. Algorithmes combinatoires et Optimisation : Combinatorial Algorithms and Optimization. [Internet] [Doctoral dissertation]. Université Paris-Saclay (ComUE); 2017. [cited 2020 Aug 05]. Available from: http://www.theses.fr/2017SACLS517.

Council of Science Editors:

Manoussakis GO. Algorithmes combinatoires et Optimisation : Combinatorial Algorithms and Optimization. [Doctoral Dissertation]. Université Paris-Saclay (ComUE); 2017. Available from: http://www.theses.fr/2017SACLS517

21. Kafer, Sean. On The Circuit Diameters of Some Combinatorial Polytopes.

Degree: 2017, University of Waterloo

 The combinatorial diameter of a polytope P is the maximum value of a shortest path between two vertices of P, where the path uses the… (more)

Subjects/Keywords: Circuit Diameter; Hirsch Conjecture; Circuit Hirsch Conjecture; Traveling Salesman Polytope; Matching Polytope; Perfect Matching Polytope; Polytope Formulations; Fractional Stable Set Polytope; Combinatorial Diameter; Spanning Tree Polytope; Matroid Polytope

…Chapter 1 Introduction For a polytope P ⊆ Rd , the 1-skeleton of P is the graph given by… …combinatorial diameter of a polytope. The most famous conjecture in this context is the Hirsch… …polytope with f facets is at most f − d. While this conjecture has been disproved [20]… …with one such notion of diameter: the circuit diameter of a polytope, formalized by Borgwardt… …et al. [5]. Given a polytope of the form P = {x ∈ Rn : Ax = b, Bx ≤ d}… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kafer, S. (2017). On The Circuit Diameters of Some Combinatorial Polytopes. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/12413

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

Kafer, Sean. “On The Circuit Diameters of Some Combinatorial Polytopes.” 2017. Thesis, University of Waterloo. Accessed August 05, 2020. http://hdl.handle.net/10012/12413.

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

MLA Handbook (7th Edition):

Kafer, Sean. “On The Circuit Diameters of Some Combinatorial Polytopes.” 2017. Web. 05 Aug 2020.

Vancouver:

Kafer S. On The Circuit Diameters of Some Combinatorial Polytopes. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/10012/12413.

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

Council of Science Editors:

Kafer S. On The Circuit Diameters of Some Combinatorial Polytopes. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/12413

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

22. Grandguillaume, Laureen. Execution adaptative de trajectoire 5 axes sur structures poly-articulées : Adaptative execution of 5 axis tool path on polyarticulated structure.

Degree: Docteur es, Génie mécanique, 2017, Université Paris-Saclay (ComUE)

L’usinage 5 axes à grande vitesse est de plus en plus utilisé dans l’industrie pour réaliser des pièces de géométrie complexe à forte valeur ajoutée… (more)

Subjects/Keywords: Usinage 5 axes; Usinage à grande vitesse; Génération de trajectoire; Polytope; Cinématique; Manipulabilité; 5 axes machining; High speed machining; Toolpath computation; Polytope; Kinematic; Manipulability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Grandguillaume, L. (2017). Execution adaptative de trajectoire 5 axes sur structures poly-articulées : Adaptative execution of 5 axis tool path on polyarticulated structure. (Doctoral Dissertation). Université Paris-Saclay (ComUE). Retrieved from http://www.theses.fr/2017SACLN059

Chicago Manual of Style (16th Edition):

Grandguillaume, Laureen. “Execution adaptative de trajectoire 5 axes sur structures poly-articulées : Adaptative execution of 5 axis tool path on polyarticulated structure.” 2017. Doctoral Dissertation, Université Paris-Saclay (ComUE). Accessed August 05, 2020. http://www.theses.fr/2017SACLN059.

MLA Handbook (7th Edition):

Grandguillaume, Laureen. “Execution adaptative de trajectoire 5 axes sur structures poly-articulées : Adaptative execution of 5 axis tool path on polyarticulated structure.” 2017. Web. 05 Aug 2020.

Vancouver:

Grandguillaume L. Execution adaptative de trajectoire 5 axes sur structures poly-articulées : Adaptative execution of 5 axis tool path on polyarticulated structure. [Internet] [Doctoral dissertation]. Université Paris-Saclay (ComUE); 2017. [cited 2020 Aug 05]. Available from: http://www.theses.fr/2017SACLN059.

Council of Science Editors:

Grandguillaume L. Execution adaptative de trajectoire 5 axes sur structures poly-articulées : Adaptative execution of 5 axis tool path on polyarticulated structure. [Doctoral Dissertation]. Université Paris-Saclay (ComUE); 2017. Available from: http://www.theses.fr/2017SACLN059


Université de Lorraine

23. Meddeb Mimouni, Houda. Contribution à la commande simultanée des systèmes linéaires : Contribution to simultaneous stabilization of linear systems.

Degree: Docteur es, Automatique, Traitement du signal et des images, Génie informatique, 2017, Université de Lorraine

Dans ce mémoire, nous avons proposé une nouvelle approche pour la stabilisation des polytopes de systèmes SISO LTI avec un contrôleur d’ordre fixe. En utilisant… (more)

Subjects/Keywords: Stabilisation simultanée; Segment de systèmes; Polytope de systèmes; Approche polynomiale; Optimisation linéaire; Simultaneous stabilization; Segment of systems; Polytope of systems; Polynomial approach; Linear optimization; 629.8; 620.001 1

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Meddeb Mimouni, H. (2017). Contribution à la commande simultanée des systèmes linéaires : Contribution to simultaneous stabilization of linear systems. (Doctoral Dissertation). Université de Lorraine. Retrieved from http://www.theses.fr/2017LORR0149

Chicago Manual of Style (16th Edition):

Meddeb Mimouni, Houda. “Contribution à la commande simultanée des systèmes linéaires : Contribution to simultaneous stabilization of linear systems.” 2017. Doctoral Dissertation, Université de Lorraine. Accessed August 05, 2020. http://www.theses.fr/2017LORR0149.

MLA Handbook (7th Edition):

Meddeb Mimouni, Houda. “Contribution à la commande simultanée des systèmes linéaires : Contribution to simultaneous stabilization of linear systems.” 2017. Web. 05 Aug 2020.

Vancouver:

Meddeb Mimouni H. Contribution à la commande simultanée des systèmes linéaires : Contribution to simultaneous stabilization of linear systems. [Internet] [Doctoral dissertation]. Université de Lorraine; 2017. [cited 2020 Aug 05]. Available from: http://www.theses.fr/2017LORR0149.

Council of Science Editors:

Meddeb Mimouni H. Contribution à la commande simultanée des systèmes linéaires : Contribution to simultaneous stabilization of linear systems. [Doctoral Dissertation]. Université de Lorraine; 2017. Available from: http://www.theses.fr/2017LORR0149

24. Samy, Vincent. Commande de chute pour robots humanoïdes par reconfiguration posturale et compliance adaptative : Humanoid fall control by postural reshaping and adaptive compliance.

Degree: Docteur es, Systèmes automatiques et micro-électroniques, 2017, Montpellier

Cette thèse traite du problème de la chute de robots humanoïdes. L’étude consiste à découpler la stratégie de chute en une phase de pré-impact et… (more)

Subjects/Keywords: Robotique humanoïde; Gains adaptatifs; Stratégies de chutes sécurisées; QP-Adaptatif; Commande prédictive; Polytope; Humanoid; Adaptive gains; Human aware falling strategies; Adaptive-QP; Model predictive control; Polytope

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Samy, V. (2017). Commande de chute pour robots humanoïdes par reconfiguration posturale et compliance adaptative : Humanoid fall control by postural reshaping and adaptive compliance. (Doctoral Dissertation). Montpellier. Retrieved from http://www.theses.fr/2017MONTS059

Chicago Manual of Style (16th Edition):

Samy, Vincent. “Commande de chute pour robots humanoïdes par reconfiguration posturale et compliance adaptative : Humanoid fall control by postural reshaping and adaptive compliance.” 2017. Doctoral Dissertation, Montpellier. Accessed August 05, 2020. http://www.theses.fr/2017MONTS059.

MLA Handbook (7th Edition):

Samy, Vincent. “Commande de chute pour robots humanoïdes par reconfiguration posturale et compliance adaptative : Humanoid fall control by postural reshaping and adaptive compliance.” 2017. Web. 05 Aug 2020.

Vancouver:

Samy V. Commande de chute pour robots humanoïdes par reconfiguration posturale et compliance adaptative : Humanoid fall control by postural reshaping and adaptive compliance. [Internet] [Doctoral dissertation]. Montpellier; 2017. [cited 2020 Aug 05]. Available from: http://www.theses.fr/2017MONTS059.

Council of Science Editors:

Samy V. Commande de chute pour robots humanoïdes par reconfiguration posturale et compliance adaptative : Humanoid fall control by postural reshaping and adaptive compliance. [Doctoral Dissertation]. Montpellier; 2017. Available from: http://www.theses.fr/2017MONTS059

25. Magnouche, Youcef. The multi-terminal vertex separator problem : Complexity, Polyhedra and Algorithms : Le problème du séparateur de poids minimum : Complexité, Polyèdres et Algorithmes.

Degree: Docteur es, Informatique, 2017, Paris Sciences et Lettres

Étant donné un graphe G = (V U T, E), tel que V U T représente l'ensemble des sommets où T est un ensemble de… (more)

Subjects/Keywords: Optimisation combinatoire; Polytope; Facette; Coupes et branchements; Génération de colonnes; Composition de polyèdres; Combinatorial optimization; Polytope; Facet; Branch-And-Cut algorithm; Branch-And-Price algorithm; Composition of polyhedra; 003

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Magnouche, Y. (2017). The multi-terminal vertex separator problem : Complexity, Polyhedra and Algorithms : Le problème du séparateur de poids minimum : Complexité, Polyèdres et Algorithmes. (Doctoral Dissertation). Paris Sciences et Lettres. Retrieved from http://www.theses.fr/2017PSLED020

Chicago Manual of Style (16th Edition):

Magnouche, Youcef. “The multi-terminal vertex separator problem : Complexity, Polyhedra and Algorithms : Le problème du séparateur de poids minimum : Complexité, Polyèdres et Algorithmes.” 2017. Doctoral Dissertation, Paris Sciences et Lettres. Accessed August 05, 2020. http://www.theses.fr/2017PSLED020.

MLA Handbook (7th Edition):

Magnouche, Youcef. “The multi-terminal vertex separator problem : Complexity, Polyhedra and Algorithms : Le problème du séparateur de poids minimum : Complexité, Polyèdres et Algorithmes.” 2017. Web. 05 Aug 2020.

Vancouver:

Magnouche Y. The multi-terminal vertex separator problem : Complexity, Polyhedra and Algorithms : Le problème du séparateur de poids minimum : Complexité, Polyèdres et Algorithmes. [Internet] [Doctoral dissertation]. Paris Sciences et Lettres; 2017. [cited 2020 Aug 05]. Available from: http://www.theses.fr/2017PSLED020.

Council of Science Editors:

Magnouche Y. The multi-terminal vertex separator problem : Complexity, Polyhedra and Algorithms : Le problème du séparateur de poids minimum : Complexité, Polyèdres et Algorithmes. [Doctoral Dissertation]. Paris Sciences et Lettres; 2017. Available from: http://www.theses.fr/2017PSLED020

26. Zissulescu-Ianculescu, Claudiu. Synthesis of a parallel data stream processor from data flow process networks.

Degree: 2008, LIACS Embedded Research Center (LERC), Leiden Institute of Advanced Computer Science (LIACS), Faculty of Science, Leiden University

 In this talk, we address the problem of synthesizing Process Network specifications to FPGA execution platforms. The process networks we consider are special cases of… (more)

Subjects/Keywords: KPN; Compaan; Laura; Synthesis; VHDL; Polytope; KPN; Compaan; Laura; Synthesis; VHDL; Polytope

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zissulescu-Ianculescu, C. (2008). Synthesis of a parallel data stream processor from data flow process networks. (Doctoral Dissertation). LIACS Embedded Research Center (LERC), Leiden Institute of Advanced Computer Science (LIACS), Faculty of Science, Leiden University. Retrieved from http://hdl.handle.net/1887/13262

Chicago Manual of Style (16th Edition):

Zissulescu-Ianculescu, Claudiu. “Synthesis of a parallel data stream processor from data flow process networks.” 2008. Doctoral Dissertation, LIACS Embedded Research Center (LERC), Leiden Institute of Advanced Computer Science (LIACS), Faculty of Science, Leiden University. Accessed August 05, 2020. http://hdl.handle.net/1887/13262.

MLA Handbook (7th Edition):

Zissulescu-Ianculescu, Claudiu. “Synthesis of a parallel data stream processor from data flow process networks.” 2008. Web. 05 Aug 2020.

Vancouver:

Zissulescu-Ianculescu C. Synthesis of a parallel data stream processor from data flow process networks. [Internet] [Doctoral dissertation]. LIACS Embedded Research Center (LERC), Leiden Institute of Advanced Computer Science (LIACS), Faculty of Science, Leiden University; 2008. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/1887/13262.

Council of Science Editors:

Zissulescu-Ianculescu C. Synthesis of a parallel data stream processor from data flow process networks. [Doctoral Dissertation]. LIACS Embedded Research Center (LERC), Leiden Institute of Advanced Computer Science (LIACS), Faculty of Science, Leiden University; 2008. Available from: http://hdl.handle.net/1887/13262


University of California – Irvine

27. Smith, Luke Alexander. Refining Multivariate Value Set Bounds.

Degree: Mathematics, 2015, University of California – Irvine

 Over finite fields, if the image of a polynomial map is not the entire field, then its cardinality can be bounded above by a significantly… (more)

Subjects/Keywords: Mathematics; Finite Fields; Multivariate; Newton Polytope; Number Theory; Polynomial Maps; Value Set

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Smith, L. A. (2015). Refining Multivariate Value Set Bounds. (Thesis). University of California – Irvine. Retrieved from http://www.escholarship.org/uc/item/1c11x6gb

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

Smith, Luke Alexander. “Refining Multivariate Value Set Bounds.” 2015. Thesis, University of California – Irvine. Accessed August 05, 2020. http://www.escholarship.org/uc/item/1c11x6gb.

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

MLA Handbook (7th Edition):

Smith, Luke Alexander. “Refining Multivariate Value Set Bounds.” 2015. Web. 05 Aug 2020.

Vancouver:

Smith LA. Refining Multivariate Value Set Bounds. [Internet] [Thesis]. University of California – Irvine; 2015. [cited 2020 Aug 05]. Available from: http://www.escholarship.org/uc/item/1c11x6gb.

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

Council of Science Editors:

Smith LA. Refining Multivariate Value Set Bounds. [Thesis]. University of California – Irvine; 2015. Available from: http://www.escholarship.org/uc/item/1c11x6gb

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


University of California – Berkeley

28. Cueto, Maria Angelica. Tropical implicitization.

Degree: Mathematics, 2010, University of California – Berkeley

 In recent years, tropical geometry has developed as a theory on its own. Its two main aims are to answer open questions in algebraic geometry… (more)

Subjects/Keywords: Mathematics; algebraic statistics; geometric tropicalization; Hadamard products; Newton polytope; secant varieties; tropical geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cueto, M. A. (2010). Tropical implicitization. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/7d6845sr

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

Cueto, Maria Angelica. “Tropical implicitization.” 2010. Thesis, University of California – Berkeley. Accessed August 05, 2020. http://www.escholarship.org/uc/item/7d6845sr.

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

MLA Handbook (7th Edition):

Cueto, Maria Angelica. “Tropical implicitization.” 2010. Web. 05 Aug 2020.

Vancouver:

Cueto MA. Tropical implicitization. [Internet] [Thesis]. University of California – Berkeley; 2010. [cited 2020 Aug 05]. Available from: http://www.escholarship.org/uc/item/7d6845sr.

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

Council of Science Editors:

Cueto MA. Tropical implicitization. [Thesis]. University of California – Berkeley; 2010. Available from: http://www.escholarship.org/uc/item/7d6845sr

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


Universiteit Utrecht

29. Hu, H. On the Extension Complexity of Stable Set Polytopes for Perfect Graphs.

Degree: 2015, Universiteit Utrecht

 In linear programming one can formulate many combinatorial optimization problems as optimizing a linear function over a feasible region that is a polytope. A polytope(more)

Subjects/Keywords: linear programming; extension complexity; communication theory; stable set polytope; graph operations; perfect graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hu, H. (2015). On the Extension Complexity of Stable Set Polytopes for Perfect Graphs. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/316002

Chicago Manual of Style (16th Edition):

Hu, H. “On the Extension Complexity of Stable Set Polytopes for Perfect Graphs.” 2015. Masters Thesis, Universiteit Utrecht. Accessed August 05, 2020. http://dspace.library.uu.nl:8080/handle/1874/316002.

MLA Handbook (7th Edition):

Hu, H. “On the Extension Complexity of Stable Set Polytopes for Perfect Graphs.” 2015. Web. 05 Aug 2020.

Vancouver:

Hu H. On the Extension Complexity of Stable Set Polytopes for Perfect Graphs. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2020 Aug 05]. Available from: http://dspace.library.uu.nl:8080/handle/1874/316002.

Council of Science Editors:

Hu H. On the Extension Complexity of Stable Set Polytopes for Perfect Graphs. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/316002


Texas A&M University

30. Hackemack, Michael Wayne. Higher-Order DGFEM Transport Calculations on Polytope Meshes for Massively-Parallel Architectures.

Degree: PhD, Nuclear Engineering, 2016, Texas A&M University

 In this dissertation, we develop improvements to the discrete ordinates (S_N) neutron transport equation using a Discontinuous Galerkin Finite Element Method (DGFEM) spatial discretization on… (more)

Subjects/Keywords: neutron transport; polytope basis functions; higher-order; diffusion synthetic acceleration; massively-parallel; diffusion

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hackemack, M. W. (2016). Higher-Order DGFEM Transport Calculations on Polytope Meshes for Massively-Parallel Architectures. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/157991

Chicago Manual of Style (16th Edition):

Hackemack, Michael Wayne. “Higher-Order DGFEM Transport Calculations on Polytope Meshes for Massively-Parallel Architectures.” 2016. Doctoral Dissertation, Texas A&M University. Accessed August 05, 2020. http://hdl.handle.net/1969.1/157991.

MLA Handbook (7th Edition):

Hackemack, Michael Wayne. “Higher-Order DGFEM Transport Calculations on Polytope Meshes for Massively-Parallel Architectures.” 2016. Web. 05 Aug 2020.

Vancouver:

Hackemack MW. Higher-Order DGFEM Transport Calculations on Polytope Meshes for Massively-Parallel Architectures. [Internet] [Doctoral dissertation]. Texas A&M University; 2016. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/1969.1/157991.

Council of Science Editors:

Hackemack MW. Higher-Order DGFEM Transport Calculations on Polytope Meshes for Massively-Parallel Architectures. [Doctoral Dissertation]. Texas A&M University; 2016. Available from: http://hdl.handle.net/1969.1/157991

[1] [2] [3] [4]

.