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

[1] [2] [3]

Search Limiters

Last 2 Years | English Only

▼ Search Limiters

1. Mattingly, Philip A., 1979-. P=NP.

Degree: 2010, Texas Digital Library

Subjects/Keywords: Polynomial Time

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mattingly, Philip A., 1. (2010). P=NP. (Thesis). Texas Digital Library. Retrieved from http://hdl.handle.net/2249.1/66439

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

Mattingly, Philip A., 1979-. “P=NP.” 2010. Thesis, Texas Digital Library. Accessed September 15, 2019. http://hdl.handle.net/2249.1/66439.

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

MLA Handbook (7th Edition):

Mattingly, Philip A., 1979-. “P=NP.” 2010. Web. 15 Sep 2019.

Vancouver:

Mattingly, Philip A. 1. P=NP. [Internet] [Thesis]. Texas Digital Library; 2010. [cited 2019 Sep 15]. Available from: http://hdl.handle.net/2249.1/66439.

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

Council of Science Editors:

Mattingly, Philip A. 1. P=NP. [Thesis]. Texas Digital Library; 2010. Available from: http://hdl.handle.net/2249.1/66439

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

2. Mattingly, Philip A., 1979-. P=NP.

Degree: 2010, Texas Digital Library

Subjects/Keywords: Polynomial Time

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mattingly, Philip A., 1. (2010). P=NP. (Thesis). Texas Digital Library. Retrieved from http://hdl.handle.net/2249.1/64381

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

Mattingly, Philip A., 1979-. “P=NP.” 2010. Thesis, Texas Digital Library. Accessed September 15, 2019. http://hdl.handle.net/2249.1/64381.

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

MLA Handbook (7th Edition):

Mattingly, Philip A., 1979-. “P=NP.” 2010. Web. 15 Sep 2019.

Vancouver:

Mattingly, Philip A. 1. P=NP. [Internet] [Thesis]. Texas Digital Library; 2010. [cited 2019 Sep 15]. Available from: http://hdl.handle.net/2249.1/64381.

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

Council of Science Editors:

Mattingly, Philip A. 1. P=NP. [Thesis]. Texas Digital Library; 2010. Available from: http://hdl.handle.net/2249.1/64381

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

3. Mattingly, Philip A., 1979-. P=NP.

Degree: 2010, Texas Digital Library

Subjects/Keywords: Polynomial Time

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mattingly, Philip A., 1. (2010). P=NP. (Thesis). Texas Digital Library. Retrieved from http://hdl.handle.net/2249.1/66904

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

Mattingly, Philip A., 1979-. “P=NP.” 2010. Thesis, Texas Digital Library. Accessed September 15, 2019. http://hdl.handle.net/2249.1/66904.

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

MLA Handbook (7th Edition):

Mattingly, Philip A., 1979-. “P=NP.” 2010. Web. 15 Sep 2019.

Vancouver:

Mattingly, Philip A. 1. P=NP. [Internet] [Thesis]. Texas Digital Library; 2010. [cited 2019 Sep 15]. Available from: http://hdl.handle.net/2249.1/66904.

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

Council of Science Editors:

Mattingly, Philip A. 1. P=NP. [Thesis]. Texas Digital Library; 2010. Available from: http://hdl.handle.net/2249.1/66904

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


Florida International University

4. Granados, Omar D. Space-Time Coding for Polynomial Phase Modulated Signals.

Degree: Electrical Engineering, 2011, Florida International University

Polynomial phase modulated (PPM) signals have been shown to provide improved error rate performance with respect to conventional modulation formats under additive white Gaussian… (more)

Subjects/Keywords: Space-time coding; polynomial phase signals

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Granados, O. D. (2011). Space-Time Coding for Polynomial Phase Modulated Signals. (Thesis). Florida International University. Retrieved from http://digitalcommons.fiu.edu/etd/378 ; 10.25148/etd.FI11050305 ; FI11050305

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

Granados, Omar D. “Space-Time Coding for Polynomial Phase Modulated Signals.” 2011. Thesis, Florida International University. Accessed September 15, 2019. http://digitalcommons.fiu.edu/etd/378 ; 10.25148/etd.FI11050305 ; FI11050305.

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

MLA Handbook (7th Edition):

Granados, Omar D. “Space-Time Coding for Polynomial Phase Modulated Signals.” 2011. Web. 15 Sep 2019.

Vancouver:

Granados OD. Space-Time Coding for Polynomial Phase Modulated Signals. [Internet] [Thesis]. Florida International University; 2011. [cited 2019 Sep 15]. Available from: http://digitalcommons.fiu.edu/etd/378 ; 10.25148/etd.FI11050305 ; FI11050305.

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

Council of Science Editors:

Granados OD. Space-Time Coding for Polynomial Phase Modulated Signals. [Thesis]. Florida International University; 2011. Available from: http://digitalcommons.fiu.edu/etd/378 ; 10.25148/etd.FI11050305 ; FI11050305

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


University of Toronto

5. Gu, Zixi. Enhancing the Efficiency of the Polynomial Chaos Expansion Finite-difference Time-domain Method.

Degree: 2014, University of Toronto

The polynomial chaos based finite-difference time-domain (PCE-FDTD) method is a promising technique for quantifying the impact of parameter variability on the performance metrics of electromagnetic… (more)

Subjects/Keywords: Finite-difference time-domain; polynomial chaos; uncertainty quantification; 0607

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gu, Z. (2014). Enhancing the Efficiency of the Polynomial Chaos Expansion Finite-difference Time-domain Method. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/68085

Chicago Manual of Style (16th Edition):

Gu, Zixi. “Enhancing the Efficiency of the Polynomial Chaos Expansion Finite-difference Time-domain Method.” 2014. Masters Thesis, University of Toronto. Accessed September 15, 2019. http://hdl.handle.net/1807/68085.

MLA Handbook (7th Edition):

Gu, Zixi. “Enhancing the Efficiency of the Polynomial Chaos Expansion Finite-difference Time-domain Method.” 2014. Web. 15 Sep 2019.

Vancouver:

Gu Z. Enhancing the Efficiency of the Polynomial Chaos Expansion Finite-difference Time-domain Method. [Internet] [Masters thesis]. University of Toronto; 2014. [cited 2019 Sep 15]. Available from: http://hdl.handle.net/1807/68085.

Council of Science Editors:

Gu Z. Enhancing the Efficiency of the Polynomial Chaos Expansion Finite-difference Time-domain Method. [Masters Thesis]. University of Toronto; 2014. Available from: http://hdl.handle.net/1807/68085


University of Edinburgh

6. Hofmann, Martin. Type Systems For Polynomial-time Computation.

Degree: 1999, University of Edinburgh

 This thesis introduces and studies a typed lambda calculus with higher-order primitive recursion over inductive datatypes which has the property that all definable number-theoretic functions… (more)

Subjects/Keywords: typed lambda calculi; polynomial time algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hofmann, M. (1999). Type Systems For Polynomial-time Computation. (Thesis). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/510

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

Hofmann, Martin. “Type Systems For Polynomial-time Computation.” 1999. Thesis, University of Edinburgh. Accessed September 15, 2019. http://hdl.handle.net/1842/510.

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

MLA Handbook (7th Edition):

Hofmann, Martin. “Type Systems For Polynomial-time Computation.” 1999. Web. 15 Sep 2019.

Vancouver:

Hofmann M. Type Systems For Polynomial-time Computation. [Internet] [Thesis]. University of Edinburgh; 1999. [cited 2019 Sep 15]. Available from: http://hdl.handle.net/1842/510.

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

Council of Science Editors:

Hofmann M. Type Systems For Polynomial-time Computation. [Thesis]. University of Edinburgh; 1999. Available from: http://hdl.handle.net/1842/510

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

7. Gracia nirmala rani D. Analysis and optimization of Floorplanning algorithms for VLSI physical design;.

Degree: Analysis and optimization of Floorplanning algorithms for VLSI physical design, 2015, Anna University

Rapid advances in semiconductor technologies have led to a newlinedramatic increase in the complexity of Very Large Scale Integration VLSI newlinecircuits With fabrication technology entering… (more)

Subjects/Keywords: Computer Aided Design; Integrated Circuits; Non Deterministic Polynomial time; Very Large Scale Integration

Page 1

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

D, G. n. r. (2015). Analysis and optimization of Floorplanning algorithms for VLSI physical design;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/38605

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

D, Gracia nirmala rani. “Analysis and optimization of Floorplanning algorithms for VLSI physical design;.” 2015. Thesis, Anna University. Accessed September 15, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/38605.

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

MLA Handbook (7th Edition):

D, Gracia nirmala rani. “Analysis and optimization of Floorplanning algorithms for VLSI physical design;.” 2015. Web. 15 Sep 2019.

Vancouver:

D Gnr. Analysis and optimization of Floorplanning algorithms for VLSI physical design;. [Internet] [Thesis]. Anna University; 2015. [cited 2019 Sep 15]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/38605.

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

Council of Science Editors:

D Gnr. Analysis and optimization of Floorplanning algorithms for VLSI physical design;. [Thesis]. Anna University; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/38605

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


University of Canterbury

8. Brettell, Nicholas John. Aspects of Matroid Connectivity.

Degree: School of Mathematics and Statistics, 2014, University of Canterbury

 Connectivity is a fundamental tool for matroid theorists, which has become increasingly important in the eventual solution of many problems in matroid theory. Loosely speaking,… (more)

Subjects/Keywords: matroid theory; connectivity; chain theorem; splitter theorem; tree decomposition; k-tree; polynomial-time algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brettell, N. J. (2014). Aspects of Matroid Connectivity. (Thesis). University of Canterbury. Retrieved from http://hdl.handle.net/10092/9215

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

Brettell, Nicholas John. “Aspects of Matroid Connectivity.” 2014. Thesis, University of Canterbury. Accessed September 15, 2019. http://hdl.handle.net/10092/9215.

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

MLA Handbook (7th Edition):

Brettell, Nicholas John. “Aspects of Matroid Connectivity.” 2014. Web. 15 Sep 2019.

Vancouver:

Brettell NJ. Aspects of Matroid Connectivity. [Internet] [Thesis]. University of Canterbury; 2014. [cited 2019 Sep 15]. Available from: http://hdl.handle.net/10092/9215.

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

Council of Science Editors:

Brettell NJ. Aspects of Matroid Connectivity. [Thesis]. University of Canterbury; 2014. Available from: http://hdl.handle.net/10092/9215

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


University of California – Berkeley

9. Hill, Cameron Donnay. Geometric Model Theory in Efficient Computability.

Degree: Mathematics, 2010, University of California – Berkeley

 This dissertation consists of the proof of a single main result linking geometric ideas from the first-order model theory of infinite structures with complexity-theoretic analyses… (more)

Subjects/Keywords: Mathematics; Computer Science; Logic; Combinatorial geometries; Coordinatization; Model theory; Polynomial-time; Rosy theories

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hill, C. D. (2010). Geometric Model Theory in Efficient Computability. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/4fh9t284

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

Hill, Cameron Donnay. “Geometric Model Theory in Efficient Computability.” 2010. Thesis, University of California – Berkeley. Accessed September 15, 2019. http://www.escholarship.org/uc/item/4fh9t284.

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

MLA Handbook (7th Edition):

Hill, Cameron Donnay. “Geometric Model Theory in Efficient Computability.” 2010. Web. 15 Sep 2019.

Vancouver:

Hill CD. Geometric Model Theory in Efficient Computability. [Internet] [Thesis]. University of California – Berkeley; 2010. [cited 2019 Sep 15]. Available from: http://www.escholarship.org/uc/item/4fh9t284.

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

Council of Science Editors:

Hill CD. Geometric Model Theory in Efficient Computability. [Thesis]. University of California – Berkeley; 2010. Available from: http://www.escholarship.org/uc/item/4fh9t284

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


Purdue University

10. Park, Chong Hyun. Parametric approaches to fractional programs: Analytical and empirical study.

Degree: PhD, Management, 2016, Purdue University

  Fractional programming is used to model problems where the objective function is a ratio of functions. A parametric modeling approach provides effective technique for… (more)

Subjects/Keywords: Applied sciences; Complexity; Fractional programming; Numerical optimization; Polynomial time algorithm; Applied Mathematics; Operational Research

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Park, C. H. (2016). Parametric approaches to fractional programs: Analytical and empirical study. (Doctoral Dissertation). Purdue University. Retrieved from http://docs.lib.purdue.edu/open_access_dissertations/825

Chicago Manual of Style (16th Edition):

Park, Chong Hyun. “Parametric approaches to fractional programs: Analytical and empirical study.” 2016. Doctoral Dissertation, Purdue University. Accessed September 15, 2019. http://docs.lib.purdue.edu/open_access_dissertations/825.

MLA Handbook (7th Edition):

Park, Chong Hyun. “Parametric approaches to fractional programs: Analytical and empirical study.” 2016. Web. 15 Sep 2019.

Vancouver:

Park CH. Parametric approaches to fractional programs: Analytical and empirical study. [Internet] [Doctoral dissertation]. Purdue University; 2016. [cited 2019 Sep 15]. Available from: http://docs.lib.purdue.edu/open_access_dissertations/825.

Council of Science Editors:

Park CH. Parametric approaches to fractional programs: Analytical and empirical study. [Doctoral Dissertation]. Purdue University; 2016. Available from: http://docs.lib.purdue.edu/open_access_dissertations/825


University of Western Ontario

11. Burrell, Michael J. Resource Bound Guarantees via Programming Languages.

Degree: 2017, University of Western Ontario

 We present a programming language in which every well-typed program halts in time polynomial with respect to its input and, more importantly, in which upper… (more)

Subjects/Keywords: programming language; static analysis; resource bounds; type inference; polynomial time; time complexity; category theory; Programming Languages and Compilers; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Burrell, M. J. (2017). Resource Bound Guarantees via Programming Languages. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/4740

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

Burrell, Michael J. “Resource Bound Guarantees via Programming Languages.” 2017. Thesis, University of Western Ontario. Accessed September 15, 2019. https://ir.lib.uwo.ca/etd/4740.

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

MLA Handbook (7th Edition):

Burrell, Michael J. “Resource Bound Guarantees via Programming Languages.” 2017. Web. 15 Sep 2019.

Vancouver:

Burrell MJ. Resource Bound Guarantees via Programming Languages. [Internet] [Thesis]. University of Western Ontario; 2017. [cited 2019 Sep 15]. Available from: https://ir.lib.uwo.ca/etd/4740.

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

Council of Science Editors:

Burrell MJ. Resource Bound Guarantees via Programming Languages. [Thesis]. University of Western Ontario; 2017. Available from: https://ir.lib.uwo.ca/etd/4740

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

12. Perrinel, Matthieu. Investigating the expressivity of linear logic subsystems characterizing polynomial time : Exploration de l’expressivité des sous-systèmes de la logique linéaire caractérisant le temps polynomial.

Degree: Docteur es, Informatique, 2015, Lyon, École normale supérieure

La complexité implicite est la caractérisation de classes de complexité par des restrictions syntaxiques sur des modèles de calcul. Plusieurs sous-systèmes de la logique linéaire… (more)

Subjects/Keywords: Complexité implicite; Sémantique des contextes; Logique linéaire; Réseaux d'intéractions; Temps polynomial; Primitif récursif; Implicit complexity; Context semantics; Linear logic; Interaction nets; Polynomial time; Primitive recursive

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Perrinel, M. (2015). Investigating the expressivity of linear logic subsystems characterizing polynomial time : Exploration de l’expressivité des sous-systèmes de la logique linéaire caractérisant le temps polynomial. (Doctoral Dissertation). Lyon, École normale supérieure. Retrieved from http://www.theses.fr/2015ENSL1001

Chicago Manual of Style (16th Edition):

Perrinel, Matthieu. “Investigating the expressivity of linear logic subsystems characterizing polynomial time : Exploration de l’expressivité des sous-systèmes de la logique linéaire caractérisant le temps polynomial.” 2015. Doctoral Dissertation, Lyon, École normale supérieure. Accessed September 15, 2019. http://www.theses.fr/2015ENSL1001.

MLA Handbook (7th Edition):

Perrinel, Matthieu. “Investigating the expressivity of linear logic subsystems characterizing polynomial time : Exploration de l’expressivité des sous-systèmes de la logique linéaire caractérisant le temps polynomial.” 2015. Web. 15 Sep 2019.

Vancouver:

Perrinel M. Investigating the expressivity of linear logic subsystems characterizing polynomial time : Exploration de l’expressivité des sous-systèmes de la logique linéaire caractérisant le temps polynomial. [Internet] [Doctoral dissertation]. Lyon, École normale supérieure; 2015. [cited 2019 Sep 15]. Available from: http://www.theses.fr/2015ENSL1001.

Council of Science Editors:

Perrinel M. Investigating the expressivity of linear logic subsystems characterizing polynomial time : Exploration de l’expressivité des sous-systèmes de la logique linéaire caractérisant le temps polynomial. [Doctoral Dissertation]. Lyon, École normale supérieure; 2015. Available from: http://www.theses.fr/2015ENSL1001


Anna University

13. Balaji N. Heuristic algorithms for the multi-period fixed charge models.

Degree: Mechanical Engineering, 2004, Anna University

The multi-period fixed charge problem is an extension of the multiperiod distribution problem and general fixed charge transportation problem, where the time based decisions on… (more)

Subjects/Keywords: Multiperiod distribution problem; Fixed charge transportation; Non-deterministic Polynomial-time; Simulated Annealing Algorithm; Genetic Algorithm; Equivalent Variable Cost

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

N, B. (2004). Heuristic algorithms for the multi-period fixed charge models. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/9880

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

N, Balaji. “Heuristic algorithms for the multi-period fixed charge models.” 2004. Thesis, Anna University. Accessed September 15, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/9880.

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

MLA Handbook (7th Edition):

N, Balaji. “Heuristic algorithms for the multi-period fixed charge models.” 2004. Web. 15 Sep 2019.

Vancouver:

N B. Heuristic algorithms for the multi-period fixed charge models. [Internet] [Thesis]. Anna University; 2004. [cited 2019 Sep 15]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/9880.

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

Council of Science Editors:

N B. Heuristic algorithms for the multi-period fixed charge models. [Thesis]. Anna University; 2004. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/9880

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

14. Wilkley Bezerra Correia. ContribuiÃÃes ao estudo de sistemas SISO e MIMO com atraso de transporte.

Degree: PhD, 2016, Universidade Federal do Ceará

Este trabalho apresenta uma contribuiÃÃo ao estudo de controle de sistemas dinÃmicos que exibem atraso de transporte. Nesse contexto, apresenta-se uma revisÃo bibliogrÃfica que traz… (more)

Subjects/Keywords: ENGENHARIA ELETRICA; Atraso de transporte; PolinÃmio-T; Controle multivariÃvel; Optimal control; Time delay; T-polynomial; Sistemas de controle

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Correia, W. B. (2016). ContribuiÃÃes ao estudo de sistemas SISO e MIMO com atraso de transporte. (Doctoral Dissertation). Universidade Federal do Ceará. Retrieved from http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=16268 ;

Chicago Manual of Style (16th Edition):

Correia, Wilkley Bezerra. “ContribuiÃÃes ao estudo de sistemas SISO e MIMO com atraso de transporte.” 2016. Doctoral Dissertation, Universidade Federal do Ceará. Accessed September 15, 2019. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=16268 ;.

MLA Handbook (7th Edition):

Correia, Wilkley Bezerra. “ContribuiÃÃes ao estudo de sistemas SISO e MIMO com atraso de transporte.” 2016. Web. 15 Sep 2019.

Vancouver:

Correia WB. ContribuiÃÃes ao estudo de sistemas SISO e MIMO com atraso de transporte. [Internet] [Doctoral dissertation]. Universidade Federal do Ceará 2016. [cited 2019 Sep 15]. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=16268 ;.

Council of Science Editors:

Correia WB. ContribuiÃÃes ao estudo de sistemas SISO e MIMO com atraso de transporte. [Doctoral Dissertation]. Universidade Federal do Ceará 2016. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=16268 ;


Universiteit Utrecht

15. Pastink, A.J. Aspects of communication complexity for approximating Nash equilibria.

Degree: 2012, Universiteit Utrecht

 Since it was shown that finding a Nash equilibrium is PPAD-complete [Daskalakis2006], even for 2-player normal form games [Chen2006], a lot of attention has been… (more)

Subjects/Keywords: approximate Nash equilbrium; Nash equilibrium; communication complexity; well-supported Nash equilibrium; polynomial time algorithms; small games

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pastink, A. J. (2012). Aspects of communication complexity for approximating Nash equilibria. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/253425

Chicago Manual of Style (16th Edition):

Pastink, A J. “Aspects of communication complexity for approximating Nash equilibria.” 2012. Masters Thesis, Universiteit Utrecht. Accessed September 15, 2019. http://dspace.library.uu.nl:8080/handle/1874/253425.

MLA Handbook (7th Edition):

Pastink, A J. “Aspects of communication complexity for approximating Nash equilibria.” 2012. Web. 15 Sep 2019.

Vancouver:

Pastink AJ. Aspects of communication complexity for approximating Nash equilibria. [Internet] [Masters thesis]. Universiteit Utrecht; 2012. [cited 2019 Sep 15]. Available from: http://dspace.library.uu.nl:8080/handle/1874/253425.

Council of Science Editors:

Pastink AJ. Aspects of communication complexity for approximating Nash equilibria. [Masters Thesis]. Universiteit Utrecht; 2012. Available from: http://dspace.library.uu.nl:8080/handle/1874/253425


Delft University of Technology

16. Witteveen, J.A.S. Efficient and robust uncertainty quantification for computational fluid dynamics and fluid-structure interaction.

Degree: 2009, Delft University of Technology

 Physical uncertainties due to atmospheric variations and production tolerances can nowadays have a larger effect on the accuracy of computational predictions than numerical errors. It… (more)

Subjects/Keywords: non-deterministic; extrema diminishing; polynomial chaos; time-dependent

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Witteveen, J. A. S. (2009). Efficient and robust uncertainty quantification for computational fluid dynamics and fluid-structure interaction. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:01421204-c938-48fa-baba-61f7065cd65d ; urn:NBN:nl:ui:24-uuid:01421204-c938-48fa-baba-61f7065cd65d ; urn:NBN:nl:ui:24-uuid:01421204-c938-48fa-baba-61f7065cd65d ; http://resolver.tudelft.nl/uuid:01421204-c938-48fa-baba-61f7065cd65d

Chicago Manual of Style (16th Edition):

Witteveen, J A S. “Efficient and robust uncertainty quantification for computational fluid dynamics and fluid-structure interaction.” 2009. Doctoral Dissertation, Delft University of Technology. Accessed September 15, 2019. http://resolver.tudelft.nl/uuid:01421204-c938-48fa-baba-61f7065cd65d ; urn:NBN:nl:ui:24-uuid:01421204-c938-48fa-baba-61f7065cd65d ; urn:NBN:nl:ui:24-uuid:01421204-c938-48fa-baba-61f7065cd65d ; http://resolver.tudelft.nl/uuid:01421204-c938-48fa-baba-61f7065cd65d.

MLA Handbook (7th Edition):

Witteveen, J A S. “Efficient and robust uncertainty quantification for computational fluid dynamics and fluid-structure interaction.” 2009. Web. 15 Sep 2019.

Vancouver:

Witteveen JAS. Efficient and robust uncertainty quantification for computational fluid dynamics and fluid-structure interaction. [Internet] [Doctoral dissertation]. Delft University of Technology; 2009. [cited 2019 Sep 15]. Available from: http://resolver.tudelft.nl/uuid:01421204-c938-48fa-baba-61f7065cd65d ; urn:NBN:nl:ui:24-uuid:01421204-c938-48fa-baba-61f7065cd65d ; urn:NBN:nl:ui:24-uuid:01421204-c938-48fa-baba-61f7065cd65d ; http://resolver.tudelft.nl/uuid:01421204-c938-48fa-baba-61f7065cd65d.

Council of Science Editors:

Witteveen JAS. Efficient and robust uncertainty quantification for computational fluid dynamics and fluid-structure interaction. [Doctoral Dissertation]. Delft University of Technology; 2009. Available from: http://resolver.tudelft.nl/uuid:01421204-c938-48fa-baba-61f7065cd65d ; urn:NBN:nl:ui:24-uuid:01421204-c938-48fa-baba-61f7065cd65d ; urn:NBN:nl:ui:24-uuid:01421204-c938-48fa-baba-61f7065cd65d ; http://resolver.tudelft.nl/uuid:01421204-c938-48fa-baba-61f7065cd65d


Virginia Tech

17. Kolansky, Jeremy Joseph. Real-Time Ground Vehicle Parameter Estimation and System Identification for Improved Stability Controllers.

Degree: PhD, Mechanical Engineering, 2014, Virginia Tech

 Vehicle characteristics have a significant impact on handling, stability, and rollover propensity. This research is dedicated to furthering the research in and modeling of vehicle… (more)

Subjects/Keywords: Parameter Estimation; Signal Processing; Kalman Filter; Polynomial Chaos; Ground Vehicle; Stability Control; System Identification; Real-Time Estimation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kolansky, J. J. (2014). Real-Time Ground Vehicle Parameter Estimation and System Identification for Improved Stability Controllers. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/47351

Chicago Manual of Style (16th Edition):

Kolansky, Jeremy Joseph. “Real-Time Ground Vehicle Parameter Estimation and System Identification for Improved Stability Controllers.” 2014. Doctoral Dissertation, Virginia Tech. Accessed September 15, 2019. http://hdl.handle.net/10919/47351.

MLA Handbook (7th Edition):

Kolansky, Jeremy Joseph. “Real-Time Ground Vehicle Parameter Estimation and System Identification for Improved Stability Controllers.” 2014. Web. 15 Sep 2019.

Vancouver:

Kolansky JJ. Real-Time Ground Vehicle Parameter Estimation and System Identification for Improved Stability Controllers. [Internet] [Doctoral dissertation]. Virginia Tech; 2014. [cited 2019 Sep 15]. Available from: http://hdl.handle.net/10919/47351.

Council of Science Editors:

Kolansky JJ. Real-Time Ground Vehicle Parameter Estimation and System Identification for Improved Stability Controllers. [Doctoral Dissertation]. Virginia Tech; 2014. Available from: http://hdl.handle.net/10919/47351


University of Arkansas

18. Whittle, Carrie Anne. The Word Problem for the Automorphism Groups of Right-Angled Artin Groups is in P.

Degree: PhD, 2013, University of Arkansas

  We provide an algorithm which takes any given automorphism f of any given right-angled Artin group G and determines whether or not f is… (more)

Subjects/Keywords: Pure sciences; Applied sciences; Automorphism groups; Graph groups; Partially commutative groups; Polynomial time; Right-angled artin groups; Word problems; Applied Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Whittle, C. A. (2013). The Word Problem for the Automorphism Groups of Right-Angled Artin Groups is in P. (Doctoral Dissertation). University of Arkansas. Retrieved from https://scholarworks.uark.edu/etd/894

Chicago Manual of Style (16th Edition):

Whittle, Carrie Anne. “The Word Problem for the Automorphism Groups of Right-Angled Artin Groups is in P.” 2013. Doctoral Dissertation, University of Arkansas. Accessed September 15, 2019. https://scholarworks.uark.edu/etd/894.

MLA Handbook (7th Edition):

Whittle, Carrie Anne. “The Word Problem for the Automorphism Groups of Right-Angled Artin Groups is in P.” 2013. Web. 15 Sep 2019.

Vancouver:

Whittle CA. The Word Problem for the Automorphism Groups of Right-Angled Artin Groups is in P. [Internet] [Doctoral dissertation]. University of Arkansas; 2013. [cited 2019 Sep 15]. Available from: https://scholarworks.uark.edu/etd/894.

Council of Science Editors:

Whittle CA. The Word Problem for the Automorphism Groups of Right-Angled Artin Groups is in P. [Doctoral Dissertation]. University of Arkansas; 2013. Available from: https://scholarworks.uark.edu/etd/894


Iowa State University

19. Mandal, Debasis. Randomness in completeness and space-bounded computations.

Degree: 2015, Iowa State University

 The study of computational complexity investigates the role of various computational resources such as processing time, memory requirements, nondeterminism, randomness, nonuniformity, etc. to solve different… (more)

Subjects/Keywords: Computer Science; Complexity theory; ESY conjecture; Multipass machines; NP-completeness; Polynomial-time reductions; Space-bounded computations; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mandal, D. (2015). Randomness in completeness and space-bounded computations. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/14950

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

Mandal, Debasis. “Randomness in completeness and space-bounded computations.” 2015. Thesis, Iowa State University. Accessed September 15, 2019. https://lib.dr.iastate.edu/etd/14950.

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

MLA Handbook (7th Edition):

Mandal, Debasis. “Randomness in completeness and space-bounded computations.” 2015. Web. 15 Sep 2019.

Vancouver:

Mandal D. Randomness in completeness and space-bounded computations. [Internet] [Thesis]. Iowa State University; 2015. [cited 2019 Sep 15]. Available from: https://lib.dr.iastate.edu/etd/14950.

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

Council of Science Editors:

Mandal D. Randomness in completeness and space-bounded computations. [Thesis]. Iowa State University; 2015. Available from: https://lib.dr.iastate.edu/etd/14950

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


University of Guelph

20. Lee, Adrian. Investigating the Use of Perfecting Matching in an Algorithm to Detect Non-Hamiltonicity of Snarks .

Degree: 2017, University of Guelph

 The Hamilton cycle decision problem is NP-complete. No polynomial time algorithm that solves this problem is known, and may or may not exist. In this… (more)

Subjects/Keywords: algorithms; perfect matching; co-NP complete; Hamilton cycles; graph theory; polynomial time; Hamilton cycle decision problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lee, A. (2017). Investigating the Use of Perfecting Matching in an Algorithm to Detect Non-Hamiltonicity of Snarks . (Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/11591

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

Lee, Adrian. “Investigating the Use of Perfecting Matching in an Algorithm to Detect Non-Hamiltonicity of Snarks .” 2017. Thesis, University of Guelph. Accessed September 15, 2019. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/11591.

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

MLA Handbook (7th Edition):

Lee, Adrian. “Investigating the Use of Perfecting Matching in an Algorithm to Detect Non-Hamiltonicity of Snarks .” 2017. Web. 15 Sep 2019.

Vancouver:

Lee A. Investigating the Use of Perfecting Matching in an Algorithm to Detect Non-Hamiltonicity of Snarks . [Internet] [Thesis]. University of Guelph; 2017. [cited 2019 Sep 15]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/11591.

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

Council of Science Editors:

Lee A. Investigating the Use of Perfecting Matching in an Algorithm to Detect Non-Hamiltonicity of Snarks . [Thesis]. University of Guelph; 2017. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/11591

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


Virginia Tech

21. Liu, Qingyu. Delay-Aware Multi-Path Routing in a Multi-Hop Network: Algorithms and Applications.

Degree: PhD, Electrical and Computer Engineering, 2019, Virginia Tech

 Delay is known to be a critical performance metric for various real-world routing applications including multimedia communication and freight delivery. Provisioning delay-minimal (or at least… (more)

Subjects/Keywords: Delay-Aware Network Flow; Delay-Aware Multi-Path Routing; Multi-Hop Network; Network Resource Allocation; Polynomial-Time Approximation Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, Q. (2019). Delay-Aware Multi-Path Routing in a Multi-Hop Network: Algorithms and Applications. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/90405

Chicago Manual of Style (16th Edition):

Liu, Qingyu. “Delay-Aware Multi-Path Routing in a Multi-Hop Network: Algorithms and Applications.” 2019. Doctoral Dissertation, Virginia Tech. Accessed September 15, 2019. http://hdl.handle.net/10919/90405.

MLA Handbook (7th Edition):

Liu, Qingyu. “Delay-Aware Multi-Path Routing in a Multi-Hop Network: Algorithms and Applications.” 2019. Web. 15 Sep 2019.

Vancouver:

Liu Q. Delay-Aware Multi-Path Routing in a Multi-Hop Network: Algorithms and Applications. [Internet] [Doctoral dissertation]. Virginia Tech; 2019. [cited 2019 Sep 15]. Available from: http://hdl.handle.net/10919/90405.

Council of Science Editors:

Liu Q. Delay-Aware Multi-Path Routing in a Multi-Hop Network: Algorithms and Applications. [Doctoral Dissertation]. Virginia Tech; 2019. Available from: http://hdl.handle.net/10919/90405


Leiden University

22. Ciocanea Teodorescu I. Algorithms for finite rings.

Degree: 2016, Leiden University

 In this thesis we are interested in describing algorithms that answer questions arising in ring and module theory. Our focus is on deterministic polynomial-time algorithms… (more)

Subjects/Keywords: Deterministic polynomial time algorithm; Finite rings; Modules; Jacobson radical; Separability; Deterministic polynomial time algorithm; Finite rings; Modules; Jacobson radical; Separability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

I., C. T. (2016). Algorithms for finite rings. (Doctoral Dissertation). Leiden University. Retrieved from http://hdl.handle.net/1887/40676

Chicago Manual of Style (16th Edition):

I., Ciocanea Teodorescu. “Algorithms for finite rings.” 2016. Doctoral Dissertation, Leiden University. Accessed September 15, 2019. http://hdl.handle.net/1887/40676.

MLA Handbook (7th Edition):

I., Ciocanea Teodorescu. “Algorithms for finite rings.” 2016. Web. 15 Sep 2019.

Vancouver:

I. CT. Algorithms for finite rings. [Internet] [Doctoral dissertation]. Leiden University; 2016. [cited 2019 Sep 15]. Available from: http://hdl.handle.net/1887/40676.

Council of Science Editors:

I. CT. Algorithms for finite rings. [Doctoral Dissertation]. Leiden University; 2016. Available from: http://hdl.handle.net/1887/40676


University of Alberta

23. Zhao, Fuqiong. Integrated Prognostics for Component Health Management.

Degree: PhD, Department of Mechanical Engineering, 2015, University of Alberta

 Prognostics in engineering field is dedicated to predicting how long further a component or a system will perform their intended functions before failure. Prognostics is… (more)

Subjects/Keywords: Stochastic Collocation; Uncertainty Quantification; Condition Monitoring; Crack Initiation Time; Bayesian Inference; Gear; Crack Propagation; Polynomial Chaos Expansion; Surface Wear; Shock; Remaining Useful Life; Integrated Prognostics; Time-varying Operating Conditions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhao, F. (2015). Integrated Prognostics for Component Health Management. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/cst74cq66z

Chicago Manual of Style (16th Edition):

Zhao, Fuqiong. “Integrated Prognostics for Component Health Management.” 2015. Doctoral Dissertation, University of Alberta. Accessed September 15, 2019. https://era.library.ualberta.ca/files/cst74cq66z.

MLA Handbook (7th Edition):

Zhao, Fuqiong. “Integrated Prognostics for Component Health Management.” 2015. Web. 15 Sep 2019.

Vancouver:

Zhao F. Integrated Prognostics for Component Health Management. [Internet] [Doctoral dissertation]. University of Alberta; 2015. [cited 2019 Sep 15]. Available from: https://era.library.ualberta.ca/files/cst74cq66z.

Council of Science Editors:

Zhao F. Integrated Prognostics for Component Health Management. [Doctoral Dissertation]. University of Alberta; 2015. Available from: https://era.library.ualberta.ca/files/cst74cq66z


McMaster University

24. Qian, Jianbo. Learning effect, Time-dependent Processing Time and Bicriteria Scheduling Problems in a Supply Chain.

Degree: 2013, McMaster University

  This thesis contains two parts. In the first part, which contains Chapter 2 and Chapter 3, we consider scheduling problems with learning effect and… (more)

Subjects/Keywords: Single-machine scheduling; learning effect; time-dependent; deteriorating effect; due date assignment; positional penalties; polynomial-time algorithm; Management Sciences and Quantitative Methods; Management Sciences and Quantitative Methods

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Qian, J. (2013). Learning effect, Time-dependent Processing Time and Bicriteria Scheduling Problems in a Supply Chain. (Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/13539

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

Qian, Jianbo. “Learning effect, Time-dependent Processing Time and Bicriteria Scheduling Problems in a Supply Chain.” 2013. Thesis, McMaster University. Accessed September 15, 2019. http://hdl.handle.net/11375/13539.

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

MLA Handbook (7th Edition):

Qian, Jianbo. “Learning effect, Time-dependent Processing Time and Bicriteria Scheduling Problems in a Supply Chain.” 2013. Web. 15 Sep 2019.

Vancouver:

Qian J. Learning effect, Time-dependent Processing Time and Bicriteria Scheduling Problems in a Supply Chain. [Internet] [Thesis]. McMaster University; 2013. [cited 2019 Sep 15]. Available from: http://hdl.handle.net/11375/13539.

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

Council of Science Editors:

Qian J. Learning effect, Time-dependent Processing Time and Bicriteria Scheduling Problems in a Supply Chain. [Thesis]. McMaster University; 2013. Available from: http://hdl.handle.net/11375/13539

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


Indian Institute of Science

25. Sreenivasa Murthy, A. Nonstationary Techniques For Signal Enhancement With Applications To Speech, ECG, And Nonuniformly-Sampled Signals.

Degree: 2012, Indian Institute of Science

 For time-varying signals such as speech and audio, short-time analysis becomes necessary to compute specific signal attributes and to keep track of their evolution. The… (more)

Subjects/Keywords: Signal Processing; Local Polynomial Modeling; Iterative Wiener Filtering; Speech Enhancement; Speech Signals; ECG Signals; Time-varying Signals; Signal Enhancement; Speech Processing; Noisy Non-Stationary Signals; Noisy Speech; Local Polynomial Model (LPM); Communication Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sreenivasa Murthy, A. (2012). Nonstationary Techniques For Signal Enhancement With Applications To Speech, ECG, And Nonuniformly-Sampled Signals. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2452

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

Sreenivasa Murthy, A. “Nonstationary Techniques For Signal Enhancement With Applications To Speech, ECG, And Nonuniformly-Sampled Signals.” 2012. Thesis, Indian Institute of Science. Accessed September 15, 2019. http://hdl.handle.net/2005/2452.

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

MLA Handbook (7th Edition):

Sreenivasa Murthy, A. “Nonstationary Techniques For Signal Enhancement With Applications To Speech, ECG, And Nonuniformly-Sampled Signals.” 2012. Web. 15 Sep 2019.

Vancouver:

Sreenivasa Murthy A. Nonstationary Techniques For Signal Enhancement With Applications To Speech, ECG, And Nonuniformly-Sampled Signals. [Internet] [Thesis]. Indian Institute of Science; 2012. [cited 2019 Sep 15]. Available from: http://hdl.handle.net/2005/2452.

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

Council of Science Editors:

Sreenivasa Murthy A. Nonstationary Techniques For Signal Enhancement With Applications To Speech, ECG, And Nonuniformly-Sampled Signals. [Thesis]. Indian Institute of Science; 2012. Available from: http://hdl.handle.net/2005/2452

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


Indian Institute of Science

26. Sreenivasa Murthy, A. Nonstationary Techniques For Signal Enhancement With Applications To Speech, ECG, And Nonuniformly-Sampled Signals.

Degree: 2012, Indian Institute of Science

 For time-varying signals such as speech and audio, short-time analysis becomes necessary to compute specific signal attributes and to keep track of their evolution. The… (more)

Subjects/Keywords: Signal Processing; Local Polynomial Modeling; Iterative Wiener Filtering; Speech Enhancement; Speech Signals; ECG Signals; Time-varying Signals; Signal Enhancement; Speech Processing; Noisy Non-Stationary Signals; Noisy Speech; Local Polynomial Model (LPM); Communication Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sreenivasa Murthy, A. (2012). Nonstationary Techniques For Signal Enhancement With Applications To Speech, ECG, And Nonuniformly-Sampled Signals. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/2452 ; http://etd.ncsi.iisc.ernet.in/abstracts/3166/G25482-Abs.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):

Sreenivasa Murthy, A. “Nonstationary Techniques For Signal Enhancement With Applications To Speech, ECG, And Nonuniformly-Sampled Signals.” 2012. Thesis, Indian Institute of Science. Accessed September 15, 2019. http://etd.iisc.ernet.in/handle/2005/2452 ; http://etd.ncsi.iisc.ernet.in/abstracts/3166/G25482-Abs.pdf.

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

MLA Handbook (7th Edition):

Sreenivasa Murthy, A. “Nonstationary Techniques For Signal Enhancement With Applications To Speech, ECG, And Nonuniformly-Sampled Signals.” 2012. Web. 15 Sep 2019.

Vancouver:

Sreenivasa Murthy A. Nonstationary Techniques For Signal Enhancement With Applications To Speech, ECG, And Nonuniformly-Sampled Signals. [Internet] [Thesis]. Indian Institute of Science; 2012. [cited 2019 Sep 15]. Available from: http://etd.iisc.ernet.in/handle/2005/2452 ; http://etd.ncsi.iisc.ernet.in/abstracts/3166/G25482-Abs.pdf.

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

Council of Science Editors:

Sreenivasa Murthy A. Nonstationary Techniques For Signal Enhancement With Applications To Speech, ECG, And Nonuniformly-Sampled Signals. [Thesis]. Indian Institute of Science; 2012. Available from: http://etd.iisc.ernet.in/handle/2005/2452 ; http://etd.ncsi.iisc.ernet.in/abstracts/3166/G25482-Abs.pdf

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

27. Mouman, Mlouka. Batch replenishment planning under capacity reservation contract : Planification d'approvisionnement par batch sous contrat de réservation de capacité.

Degree: Docteur es, Automatique, Traitement du signal et des images, Génie informatique, 2019, Université de Lorraine; École nationale d'ingénieurs de Tunis (Tunisie)

Nous nous intéressons au Problème de Dimensionnement de Lots mono-produit (PDL) dans une chaîne logistique composée d'un détaillant et d'un fournisseur en y intégrant le… (more)

Subjects/Keywords: Problème de dimensionnement de lot; Approvisionnement en batch; Contrat buyback; Ventes perdues; Mise au rebut; PLNE; Algorithme polynomial; Complexité; Lot sizing problem; Batch ordering; Buyback contract; Lost sales; Disposal; MILP; Polynomial time algorithm; Complexity; 629.8

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mouman, M. (2019). Batch replenishment planning under capacity reservation contract : Planification d'approvisionnement par batch sous contrat de réservation de capacité. (Doctoral Dissertation). Université de Lorraine; École nationale d'ingénieurs de Tunis (Tunisie). Retrieved from http://www.theses.fr/2019LORR0041

Chicago Manual of Style (16th Edition):

Mouman, Mlouka. “Batch replenishment planning under capacity reservation contract : Planification d'approvisionnement par batch sous contrat de réservation de capacité.” 2019. Doctoral Dissertation, Université de Lorraine; École nationale d'ingénieurs de Tunis (Tunisie). Accessed September 15, 2019. http://www.theses.fr/2019LORR0041.

MLA Handbook (7th Edition):

Mouman, Mlouka. “Batch replenishment planning under capacity reservation contract : Planification d'approvisionnement par batch sous contrat de réservation de capacité.” 2019. Web. 15 Sep 2019.

Vancouver:

Mouman M. Batch replenishment planning under capacity reservation contract : Planification d'approvisionnement par batch sous contrat de réservation de capacité. [Internet] [Doctoral dissertation]. Université de Lorraine; École nationale d'ingénieurs de Tunis (Tunisie); 2019. [cited 2019 Sep 15]. Available from: http://www.theses.fr/2019LORR0041.

Council of Science Editors:

Mouman M. Batch replenishment planning under capacity reservation contract : Planification d'approvisionnement par batch sous contrat de réservation de capacité. [Doctoral Dissertation]. Université de Lorraine; École nationale d'ingénieurs de Tunis (Tunisie); 2019. Available from: http://www.theses.fr/2019LORR0041


Texas A&M University

28. Huang, Xiuzhen. Parameterized complexity and polynomial-time approximation schemes.

Degree: 2005, Texas A&M University

 According to the theory of NPcompleteness, many problems that have important realworld applications are NPhard. This excludes the possibility of solving them in polynomial time(more)

Subjects/Keywords: complexity theory; lower bound; NP-hard problems; approximation; polynomial-time approximation schemes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huang, X. (2005). Parameterized complexity and polynomial-time approximation schemes. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/1446

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

Huang, Xiuzhen. “Parameterized complexity and polynomial-time approximation schemes.” 2005. Thesis, Texas A&M University. Accessed September 15, 2019. http://hdl.handle.net/1969.1/1446.

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

MLA Handbook (7th Edition):

Huang, Xiuzhen. “Parameterized complexity and polynomial-time approximation schemes.” 2005. Web. 15 Sep 2019.

Vancouver:

Huang X. Parameterized complexity and polynomial-time approximation schemes. [Internet] [Thesis]. Texas A&M University; 2005. [cited 2019 Sep 15]. Available from: http://hdl.handle.net/1969.1/1446.

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

Council of Science Editors:

Huang X. Parameterized complexity and polynomial-time approximation schemes. [Thesis]. Texas A&M University; 2005. Available from: http://hdl.handle.net/1969.1/1446

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


RMIT University

29. Jayasinghe, C. Nonparametric approach to reliability and its applications.

Degree: 2013, RMIT University

 Reliability concepts are used by reliability engineers in the industry to perform systematic reliability studies for the identification and possible elimination of failure causes, quantification… (more)

Subjects/Keywords: Fields of Research; Reliability function; Reversed Hazard Rate function; Expected Inactivity Time function; Mean Residual Life function; nonparametric estimation; bandwidth estimation; Fixed-design Local Polynomial Regression; nonparametric hypothesis testing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jayasinghe, C. (2013). Nonparametric approach to reliability and its applications. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:160465

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

Jayasinghe, C. “Nonparametric approach to reliability and its applications.” 2013. Thesis, RMIT University. Accessed September 15, 2019. http://researchbank.rmit.edu.au/view/rmit:160465.

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

MLA Handbook (7th Edition):

Jayasinghe, C. “Nonparametric approach to reliability and its applications.” 2013. Web. 15 Sep 2019.

Vancouver:

Jayasinghe C. Nonparametric approach to reliability and its applications. [Internet] [Thesis]. RMIT University; 2013. [cited 2019 Sep 15]. Available from: http://researchbank.rmit.edu.au/view/rmit:160465.

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

Council of Science Editors:

Jayasinghe C. Nonparametric approach to reliability and its applications. [Thesis]. RMIT University; 2013. Available from: http://researchbank.rmit.edu.au/view/rmit:160465

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

30. J. Lin. EXACT ALGORITHMS FOR SIZE CONSTRAINED CLUSTERING.

Degree: 2012, Università degli Studi di Milano

 This thesis investigates the following general constrained clustering problem: given a dimension d, an Lp-norm, a set X\subset\Rd, a positive integer k and a finite… (more)

Subjects/Keywords: clustering; size contraints; NP-hardness; p-norm; polynomial-time; k-set; dynamic convex hull; cylindrical algebraic decomposition; Settore INF/01 - Informatica; Settore MAT/03 - Geometria

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lin, J. (2012). EXACT ALGORITHMS FOR SIZE CONSTRAINED CLUSTERING. (Thesis). Università degli Studi di Milano. Retrieved from http://hdl.handle.net/2434/172513

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

Lin, J.. “EXACT ALGORITHMS FOR SIZE CONSTRAINED CLUSTERING.” 2012. Thesis, Università degli Studi di Milano. Accessed September 15, 2019. http://hdl.handle.net/2434/172513.

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

MLA Handbook (7th Edition):

Lin, J.. “EXACT ALGORITHMS FOR SIZE CONSTRAINED CLUSTERING.” 2012. Web. 15 Sep 2019.

Vancouver:

Lin J. EXACT ALGORITHMS FOR SIZE CONSTRAINED CLUSTERING. [Internet] [Thesis]. Università degli Studi di Milano; 2012. [cited 2019 Sep 15]. Available from: http://hdl.handle.net/2434/172513.

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

Council of Science Editors:

Lin J. EXACT ALGORITHMS FOR SIZE CONSTRAINED CLUSTERING. [Thesis]. Università degli Studi di Milano; 2012. Available from: http://hdl.handle.net/2434/172513

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

[1] [2] [3]

.