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:( Competitive algorithms). Showing records 1 – 15 of 15 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


George Mason University

1. Zhang, Zhi. Scheduling Algorithms Optimizing Throughput and Energy for Networked Systems .

Degree: 2013, George Mason University

 Scheduling problems consider allocating limited resources under constraints among competing requests in order to fulfill their obligations. Practical resource management algorithms with provable performance guarantees… (more)

Subjects/Keywords: online scheduling algorithms; throughput-aware scheduling algorithms; competitive analysis; energy-aware scheduling algorithms; networked systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, Z. (2013). Scheduling Algorithms Optimizing Throughput and Energy for Networked Systems . (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/8374

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

Zhang, Zhi. “Scheduling Algorithms Optimizing Throughput and Energy for Networked Systems .” 2013. Thesis, George Mason University. Accessed July 16, 2019. http://hdl.handle.net/1920/8374.

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

MLA Handbook (7th Edition):

Zhang, Zhi. “Scheduling Algorithms Optimizing Throughput and Energy for Networked Systems .” 2013. Web. 16 Jul 2019.

Vancouver:

Zhang Z. Scheduling Algorithms Optimizing Throughput and Energy for Networked Systems . [Internet] [Thesis]. George Mason University; 2013. [cited 2019 Jul 16]. Available from: http://hdl.handle.net/1920/8374.

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

Council of Science Editors:

Zhang Z. Scheduling Algorithms Optimizing Throughput and Energy for Networked Systems . [Thesis]. George Mason University; 2013. Available from: http://hdl.handle.net/1920/8374

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


Virginia Tech

2. Nayyar, Krati. Input Sensitive Analysis of a Minimum Metric Bipartite Matching Algorithm.

Degree: MS, Computer Science, 2017, Virginia Tech

 In various business and military settings, there is an expectation of on-demand delivery of supplies and services. Typically, several delivery vehicles (also called servers) carry… (more)

Subjects/Keywords: online algorithms; weighted matching; competitive ratio; input sensitive

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nayyar, K. (2017). Input Sensitive Analysis of a Minimum Metric Bipartite Matching Algorithm. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/86518

Chicago Manual of Style (16th Edition):

Nayyar, Krati. “Input Sensitive Analysis of a Minimum Metric Bipartite Matching Algorithm.” 2017. Masters Thesis, Virginia Tech. Accessed July 16, 2019. http://hdl.handle.net/10919/86518.

MLA Handbook (7th Edition):

Nayyar, Krati. “Input Sensitive Analysis of a Minimum Metric Bipartite Matching Algorithm.” 2017. Web. 16 Jul 2019.

Vancouver:

Nayyar K. Input Sensitive Analysis of a Minimum Metric Bipartite Matching Algorithm. [Internet] [Masters thesis]. Virginia Tech; 2017. [cited 2019 Jul 16]. Available from: http://hdl.handle.net/10919/86518.

Council of Science Editors:

Nayyar K. Input Sensitive Analysis of a Minimum Metric Bipartite Matching Algorithm. [Masters Thesis]. Virginia Tech; 2017. Available from: http://hdl.handle.net/10919/86518


University of Waterloo

3. Kamali, Shahin. Alternative Approaches for Analysis of Bin Packing and List Update Problems.

Degree: 2014, University of Waterloo

 In this thesis we introduce and evaluate new algorithms and models for the analysis of online bin packing and list update problems. These are two… (more)

Subjects/Keywords: Online Algorithms; Competitive Analysis; Bin Packing; List Update; Compression; Server Consolidation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kamali, S. (2014). Alternative Approaches for Analysis of Bin Packing and List Update Problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8843

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

Kamali, Shahin. “Alternative Approaches for Analysis of Bin Packing and List Update Problems.” 2014. Thesis, University of Waterloo. Accessed July 16, 2019. http://hdl.handle.net/10012/8843.

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

MLA Handbook (7th Edition):

Kamali, Shahin. “Alternative Approaches for Analysis of Bin Packing and List Update Problems.” 2014. Web. 16 Jul 2019.

Vancouver:

Kamali S. Alternative Approaches for Analysis of Bin Packing and List Update Problems. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2019 Jul 16]. Available from: http://hdl.handle.net/10012/8843.

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

Council of Science Editors:

Kamali S. Alternative Approaches for Analysis of Bin Packing and List Update Problems. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8843

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


University of Minnesota

4. Goyal, Shashank. Essays on The Online Multiple Knapsack Problem & The Online Reservation Problem.

Degree: PhD, Industrial Engineering, 2018, University of Minnesota

 We study two problems in this thesis, viz. the online multiple knapsack problem (OMKP) and the online reservation problem (ORP). The OMKP has applications in… (more)

Subjects/Keywords: competitive-ratio; online algorithms; scheduling; worst-case analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Goyal, S. (2018). Essays on The Online Multiple Knapsack Problem & The Online Reservation Problem. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/200184

Chicago Manual of Style (16th Edition):

Goyal, Shashank. “Essays on The Online Multiple Knapsack Problem & The Online Reservation Problem.” 2018. Doctoral Dissertation, University of Minnesota. Accessed July 16, 2019. http://hdl.handle.net/11299/200184.

MLA Handbook (7th Edition):

Goyal, Shashank. “Essays on The Online Multiple Knapsack Problem & The Online Reservation Problem.” 2018. Web. 16 Jul 2019.

Vancouver:

Goyal S. Essays on The Online Multiple Knapsack Problem & The Online Reservation Problem. [Internet] [Doctoral dissertation]. University of Minnesota; 2018. [cited 2019 Jul 16]. Available from: http://hdl.handle.net/11299/200184.

Council of Science Editors:

Goyal S. Essays on The Online Multiple Knapsack Problem & The Online Reservation Problem. [Doctoral Dissertation]. University of Minnesota; 2018. Available from: http://hdl.handle.net/11299/200184


Cornell University

5. Steele, Patrick Robert. Vehicle Routing Problems .

Degree: 2017, Cornell University

 In this dissertation we consider variants of the vehicle routing problem applied to two problem areas. First, we consider the problem of scheduling deliveries from… (more)

Subjects/Keywords: Vehicle routing problems; Operations research; Competitive algorithms; Simulation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Steele, P. R. (2017). Vehicle Routing Problems . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/47797

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

Steele, Patrick Robert. “Vehicle Routing Problems .” 2017. Thesis, Cornell University. Accessed July 16, 2019. http://hdl.handle.net/1813/47797.

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

MLA Handbook (7th Edition):

Steele, Patrick Robert. “Vehicle Routing Problems .” 2017. Web. 16 Jul 2019.

Vancouver:

Steele PR. Vehicle Routing Problems . [Internet] [Thesis]. Cornell University; 2017. [cited 2019 Jul 16]. Available from: http://hdl.handle.net/1813/47797.

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

Council of Science Editors:

Steele PR. Vehicle Routing Problems . [Thesis]. Cornell University; 2017. Available from: http://hdl.handle.net/1813/47797

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


University of Notre Dame

6. Philip Damien Little. Online Algorithms for Dynamic Data and Query Shipping in Object Caching</h1>.

Degree: MSin Computer Science and Engineering, Computer Science and Engineering, 2008, University of Notre Dame

  Many modern applications motivate variations on standard caching problems. Caching is the use of fast storage to serve frequently-requested data replicated from a slow… (more)

Subjects/Keywords: randomized algorithms; competitive analysis; caching; online algorithms; query shipping

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Little, P. D. (2008). Online Algorithms for Dynamic Data and Query Shipping in Object Caching</h1>. (Masters Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/s1784j05v6w

Chicago Manual of Style (16th Edition):

Little, Philip Damien. “Online Algorithms for Dynamic Data and Query Shipping in Object Caching</h1>.” 2008. Masters Thesis, University of Notre Dame. Accessed July 16, 2019. https://curate.nd.edu/show/s1784j05v6w.

MLA Handbook (7th Edition):

Little, Philip Damien. “Online Algorithms for Dynamic Data and Query Shipping in Object Caching</h1>.” 2008. Web. 16 Jul 2019.

Vancouver:

Little PD. Online Algorithms for Dynamic Data and Query Shipping in Object Caching</h1>. [Internet] [Masters thesis]. University of Notre Dame; 2008. [cited 2019 Jul 16]. Available from: https://curate.nd.edu/show/s1784j05v6w.

Council of Science Editors:

Little PD. Online Algorithms for Dynamic Data and Query Shipping in Object Caching</h1>. [Masters Thesis]. University of Notre Dame; 2008. Available from: https://curate.nd.edu/show/s1784j05v6w


University of Texas – Austin

7. Katti, Anil Kumar. Competitive cache replacement strategies for a shared cache.

Degree: Computer Sciences, 2011, University of Texas – Austin

 We consider cache replacement algorithms at a shared cache in a multicore system which receives an arbitrary interleaving of requests from processes that have full… (more)

Subjects/Keywords: Cache replacement algorithms; Competitive analysis; Multicore systems; Shared cache; Disjoint memory; Hierarchical cache structure; Access cost model; Cache memory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Katti, A. K. (2011). Competitive cache replacement strategies for a shared cache. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2011-05-3584

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

Katti, Anil Kumar. “Competitive cache replacement strategies for a shared cache.” 2011. Thesis, University of Texas – Austin. Accessed July 16, 2019. http://hdl.handle.net/2152/ETD-UT-2011-05-3584.

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

MLA Handbook (7th Edition):

Katti, Anil Kumar. “Competitive cache replacement strategies for a shared cache.” 2011. Web. 16 Jul 2019.

Vancouver:

Katti AK. Competitive cache replacement strategies for a shared cache. [Internet] [Thesis]. University of Texas – Austin; 2011. [cited 2019 Jul 16]. Available from: http://hdl.handle.net/2152/ETD-UT-2011-05-3584.

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

Council of Science Editors:

Katti AK. Competitive cache replacement strategies for a shared cache. [Thesis]. University of Texas – Austin; 2011. Available from: http://hdl.handle.net/2152/ETD-UT-2011-05-3584

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


University of Waterloo

8. Gaspar, Cristian. Variations on the Theme of Caching.

Degree: 2005, University of Waterloo

 This thesis is concerned with caching algorithms. We investigate three variations of the caching problem: web caching in the Torng framework, relative competitiveness and caching… (more)

Subjects/Keywords: Computer Science; caching; online algorithms; competitive ratio; request reordering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gaspar, C. (2005). Variations on the Theme of Caching. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/1048

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

Gaspar, Cristian. “Variations on the Theme of Caching.” 2005. Thesis, University of Waterloo. Accessed July 16, 2019. http://hdl.handle.net/10012/1048.

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

MLA Handbook (7th Edition):

Gaspar, Cristian. “Variations on the Theme of Caching.” 2005. Web. 16 Jul 2019.

Vancouver:

Gaspar C. Variations on the Theme of Caching. [Internet] [Thesis]. University of Waterloo; 2005. [cited 2019 Jul 16]. Available from: http://hdl.handle.net/10012/1048.

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

Council of Science Editors:

Gaspar C. Variations on the Theme of Caching. [Thesis]. University of Waterloo; 2005. Available from: http://hdl.handle.net/10012/1048

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

9. Alinia, Bahram. Optimal resource allocation strategies for electric vehicles in smart grids : Stratégies optimales d'allocation des ressources pour véhicules électriques dans les réseaux intelligents.

Degree: Docteur es, Réseaux informatiques, 2018, Evry, Institut national des télécommunications

Avec les préoccupations environnementales croissantes liées aux émissions de carbone et la chute rapide des prix des batteries, la part de marché des véhicules électriques… (more)

Subjects/Keywords: Réseaux intelligents; Véhicules électriques; Allocation de ressources; Analyse concurrentielle; Algorithmes d'approximation; Smart grids; Electric vehicles; Online scheduling; Competitive analysis; Approximation algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Alinia, B. (2018). Optimal resource allocation strategies for electric vehicles in smart grids : Stratégies optimales d'allocation des ressources pour véhicules électriques dans les réseaux intelligents. (Doctoral Dissertation). Evry, Institut national des télécommunications. Retrieved from http://www.theses.fr/2018TELE0012

Chicago Manual of Style (16th Edition):

Alinia, Bahram. “Optimal resource allocation strategies for electric vehicles in smart grids : Stratégies optimales d'allocation des ressources pour véhicules électriques dans les réseaux intelligents.” 2018. Doctoral Dissertation, Evry, Institut national des télécommunications. Accessed July 16, 2019. http://www.theses.fr/2018TELE0012.

MLA Handbook (7th Edition):

Alinia, Bahram. “Optimal resource allocation strategies for electric vehicles in smart grids : Stratégies optimales d'allocation des ressources pour véhicules électriques dans les réseaux intelligents.” 2018. Web. 16 Jul 2019.

Vancouver:

Alinia B. Optimal resource allocation strategies for electric vehicles in smart grids : Stratégies optimales d'allocation des ressources pour véhicules électriques dans les réseaux intelligents. [Internet] [Doctoral dissertation]. Evry, Institut national des télécommunications; 2018. [cited 2019 Jul 16]. Available from: http://www.theses.fr/2018TELE0012.

Council of Science Editors:

Alinia B. Optimal resource allocation strategies for electric vehicles in smart grids : Stratégies optimales d'allocation des ressources pour véhicules électriques dans les réseaux intelligents. [Doctoral Dissertation]. Evry, Institut national des télécommunications; 2018. Available from: http://www.theses.fr/2018TELE0012

10. CÃsar Lincoln Cavalcante Mattos. ComitÃs de Classificadores Baseados nas Redes SOM e Fuzzy ART com Sintonia de ParÃmetros e SeleÃÃo de Atributos via MetaheurÃsticas EvolucionÃrias.

Degree: Master, 2011, Universidade Federal do Ceará

 O paradigma de classificaÃÃo baseada em comitÃs tem recebido considerÃvel atenÃÃo na literatura cientÃfica em anos recentes. Neste contexto, redes neurais supervisionadas tÃm sido a… (more)

Subjects/Keywords: TELEINFORMATICA; Redes Neurais Competitivas; Redes Fuzzy ART; Redes SOM; ComitÃs de Classificadores; Algoritmos MetaheurÃsticos; Competitive Neural Networks; Fuzzy ART Network; SOM Network; Ensembles of Classifiers; Metaheuristic Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mattos, C. L. C. (2011). ComitÃs de Classificadores Baseados nas Redes SOM e Fuzzy ART com Sintonia de ParÃmetros e SeleÃÃo de Atributos via MetaheurÃsticas EvolucionÃrias. (Masters Thesis). Universidade Federal do Ceará. Retrieved from http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=7034 ;

Chicago Manual of Style (16th Edition):

Mattos, CÃsar Lincoln Cavalcante. “ComitÃs de Classificadores Baseados nas Redes SOM e Fuzzy ART com Sintonia de ParÃmetros e SeleÃÃo de Atributos via MetaheurÃsticas EvolucionÃrias.” 2011. Masters Thesis, Universidade Federal do Ceará. Accessed July 16, 2019. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=7034 ;.

MLA Handbook (7th Edition):

Mattos, CÃsar Lincoln Cavalcante. “ComitÃs de Classificadores Baseados nas Redes SOM e Fuzzy ART com Sintonia de ParÃmetros e SeleÃÃo de Atributos via MetaheurÃsticas EvolucionÃrias.” 2011. Web. 16 Jul 2019.

Vancouver:

Mattos CLC. ComitÃs de Classificadores Baseados nas Redes SOM e Fuzzy ART com Sintonia de ParÃmetros e SeleÃÃo de Atributos via MetaheurÃsticas EvolucionÃrias. [Internet] [Masters thesis]. Universidade Federal do Ceará 2011. [cited 2019 Jul 16]. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=7034 ;.

Council of Science Editors:

Mattos CLC. ComitÃs de Classificadores Baseados nas Redes SOM e Fuzzy ART com Sintonia de ParÃmetros e SeleÃÃo de Atributos via MetaheurÃsticas EvolucionÃrias. [Masters Thesis]. Universidade Federal do Ceará 2011. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=7034 ;


University of Texas – Austin

11. Park, Jisun. From partner selection to collaboration in information sharing multi-agent systems.

Degree: Electrical and Computer Engineering, 2006, University of Texas – Austin

 This research advances distributed information sharing by equipping nodes (e.g., software agents) in a distributed network with (1) partner selection algorithms in cooperative environments, and… (more)

Subjects/Keywords: Distributed information sharing; Equipping nodes; Psrtner selection algorithms; Competitive environments; Information acquisition

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Park, J. (2006). From partner selection to collaboration in information sharing multi-agent systems. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/7549

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

Park, Jisun. “From partner selection to collaboration in information sharing multi-agent systems.” 2006. Thesis, University of Texas – Austin. Accessed July 16, 2019. http://hdl.handle.net/2152/7549.

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

MLA Handbook (7th Edition):

Park, Jisun. “From partner selection to collaboration in information sharing multi-agent systems.” 2006. Web. 16 Jul 2019.

Vancouver:

Park J. From partner selection to collaboration in information sharing multi-agent systems. [Internet] [Thesis]. University of Texas – Austin; 2006. [cited 2019 Jul 16]. Available from: http://hdl.handle.net/2152/7549.

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

Council of Science Editors:

Park J. From partner selection to collaboration in information sharing multi-agent systems. [Thesis]. University of Texas – Austin; 2006. Available from: http://hdl.handle.net/2152/7549

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

12. Liu, Ming. Design and Evaluation of Algorithms for Online Machine Scheduling Problems : Design and Evaluation of Algorithms for Online Machine Scheduling Problems.

Degree: Docteur es, Génie industriel, 2009, Châtenay-Malabry, Ecole centrale de Paris

Dans cette thèse, nous proposons et évaluons des algorithmes pour résoudre des problèmes d’ordonnancement en ligne. Pendant des décennies, les études en ordonnancement considèrent des… (more)

Subjects/Keywords: Ordonnancement en ligne; Analyse compétitive; Algorithmes; Online scheduling; Competitive analysis; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, M. (2009). Design and Evaluation of Algorithms for Online Machine Scheduling Problems : Design and Evaluation of Algorithms for Online Machine Scheduling Problems. (Doctoral Dissertation). Châtenay-Malabry, Ecole centrale de Paris. Retrieved from http://www.theses.fr/2009ECAP0028

Chicago Manual of Style (16th Edition):

Liu, Ming. “Design and Evaluation of Algorithms for Online Machine Scheduling Problems : Design and Evaluation of Algorithms for Online Machine Scheduling Problems.” 2009. Doctoral Dissertation, Châtenay-Malabry, Ecole centrale de Paris. Accessed July 16, 2019. http://www.theses.fr/2009ECAP0028.

MLA Handbook (7th Edition):

Liu, Ming. “Design and Evaluation of Algorithms for Online Machine Scheduling Problems : Design and Evaluation of Algorithms for Online Machine Scheduling Problems.” 2009. Web. 16 Jul 2019.

Vancouver:

Liu M. Design and Evaluation of Algorithms for Online Machine Scheduling Problems : Design and Evaluation of Algorithms for Online Machine Scheduling Problems. [Internet] [Doctoral dissertation]. Châtenay-Malabry, Ecole centrale de Paris; 2009. [cited 2019 Jul 16]. Available from: http://www.theses.fr/2009ECAP0028.

Council of Science Editors:

Liu M. Design and Evaluation of Algorithms for Online Machine Scheduling Problems : Design and Evaluation of Algorithms for Online Machine Scheduling Problems. [Doctoral Dissertation]. Châtenay-Malabry, Ecole centrale de Paris; 2009. Available from: http://www.theses.fr/2009ECAP0028


Universidade do Rio Grande do Norte

13. Navarro, Marco Vinícius Monteiro. Emprego de redes neurais artificiais supervisionadas e não supervisionadas no estudo de parâmetros reológicos de excipientes farmacêuticos sólidos .

Degree: 2014, Universidade do Rio Grande do Norte

 In this paper artificial neural network (ANN) based on supervised and unsupervised algorithms were investigated for use in the study of rheological parameters of solid… (more)

Subjects/Keywords: Redes Neurais Artificiais. Redes Supervisionadas. Redes Não-supervisionadas. Excipientes Sólidos; Artificial Neural Networks. Unsupervised Algorithms. Neural Gas. Self- Organizing Maps. Pharmaceutical Solid Excipients. Rheological Parameters. Winner-Take- All. Frequency-Sensitive Competitive Lea

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Navarro, M. V. M. (2014). Emprego de redes neurais artificiais supervisionadas e não supervisionadas no estudo de parâmetros reológicos de excipientes farmacêuticos sólidos . (Doctoral Dissertation). Universidade do Rio Grande do Norte. Retrieved from http://repositorio.ufrn.br/handle/123456789/13866

Chicago Manual of Style (16th Edition):

Navarro, Marco Vinícius Monteiro. “Emprego de redes neurais artificiais supervisionadas e não supervisionadas no estudo de parâmetros reológicos de excipientes farmacêuticos sólidos .” 2014. Doctoral Dissertation, Universidade do Rio Grande do Norte. Accessed July 16, 2019. http://repositorio.ufrn.br/handle/123456789/13866.

MLA Handbook (7th Edition):

Navarro, Marco Vinícius Monteiro. “Emprego de redes neurais artificiais supervisionadas e não supervisionadas no estudo de parâmetros reológicos de excipientes farmacêuticos sólidos .” 2014. Web. 16 Jul 2019.

Vancouver:

Navarro MVM. Emprego de redes neurais artificiais supervisionadas e não supervisionadas no estudo de parâmetros reológicos de excipientes farmacêuticos sólidos . [Internet] [Doctoral dissertation]. Universidade do Rio Grande do Norte; 2014. [cited 2019 Jul 16]. Available from: http://repositorio.ufrn.br/handle/123456789/13866.

Council of Science Editors:

Navarro MVM. Emprego de redes neurais artificiais supervisionadas e não supervisionadas no estudo de parâmetros reológicos de excipientes farmacêuticos sólidos . [Doctoral Dissertation]. Universidade do Rio Grande do Norte; 2014. Available from: http://repositorio.ufrn.br/handle/123456789/13866


Universidade do Rio Grande do Norte

14. Navarro, Marco Vinícius Monteiro. Emprego de redes neurais artificiais supervisionadas e não supervisionadas no estudo de parâmetros reológicos de excipientes farmacêuticos sólidos .

Degree: 2014, Universidade do Rio Grande do Norte

 In this paper artificial neural network (ANN) based on supervised and unsupervised algorithms were investigated for use in the study of rheological parameters of solid… (more)

Subjects/Keywords: Redes Neurais Artificiais. Redes Supervisionadas. Redes Não-supervisionadas. Excipientes Sólidos; Artificial Neural Networks. Unsupervised Algorithms. Neural Gas. Self- Organizing Maps. Pharmaceutical Solid Excipients. Rheological Parameters. Winner-Take- All. Frequency-Sensitive Competitive Lea

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Navarro, M. V. M. (2014). Emprego de redes neurais artificiais supervisionadas e não supervisionadas no estudo de parâmetros reológicos de excipientes farmacêuticos sólidos . (Thesis). Universidade do Rio Grande do Norte. Retrieved from http://repositorio.ufrn.br/handle/123456789/13866

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

Navarro, Marco Vinícius Monteiro. “Emprego de redes neurais artificiais supervisionadas e não supervisionadas no estudo de parâmetros reológicos de excipientes farmacêuticos sólidos .” 2014. Thesis, Universidade do Rio Grande do Norte. Accessed July 16, 2019. http://repositorio.ufrn.br/handle/123456789/13866.

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

MLA Handbook (7th Edition):

Navarro, Marco Vinícius Monteiro. “Emprego de redes neurais artificiais supervisionadas e não supervisionadas no estudo de parâmetros reológicos de excipientes farmacêuticos sólidos .” 2014. Web. 16 Jul 2019.

Vancouver:

Navarro MVM. Emprego de redes neurais artificiais supervisionadas e não supervisionadas no estudo de parâmetros reológicos de excipientes farmacêuticos sólidos . [Internet] [Thesis]. Universidade do Rio Grande do Norte; 2014. [cited 2019 Jul 16]. Available from: http://repositorio.ufrn.br/handle/123456789/13866.

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

Council of Science Editors:

Navarro MVM. Emprego de redes neurais artificiais supervisionadas e não supervisionadas no estudo de parâmetros reológicos de excipientes farmacêuticos sólidos . [Thesis]. Universidade do Rio Grande do Norte; 2014. Available from: http://repositorio.ufrn.br/handle/123456789/13866

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


Pontifical Catholic University of Rio de Janeiro

15. MARCELO ALBUQUERQUE FERNANDES MAS. [en] A STUDY ON UNIT-DEMAND AUCTIONS.

Degree: 2006, Pontifical Catholic University of Rio de Janeiro

[pt] Este trabalho se concentra no desenvolvimento de mecanismos de leilões reveladores aleatorizados que buscam maximizar simultaneamente a receita e a eficiência econômica, ou função… (more)

Subjects/Keywords: [pt] LEILOES COMPETITIVOS; [en] COMPETITIVE AUCTIONS; [pt] LEILOES REVELADORES; [en] TRUTHFUL AUCTIONS; [pt] ALGORITMOS ALEATORIZADOS; [en] RANDOMIZED ALGORITHMS

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

MAS, M. A. F. (2006). [en] A STUDY ON UNIT-DEMAND AUCTIONS. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=9208

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

MAS, MARCELO ALBUQUERQUE FERNANDES. “[en] A STUDY ON UNIT-DEMAND AUCTIONS.” 2006. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed July 16, 2019. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=9208.

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

MLA Handbook (7th Edition):

MAS, MARCELO ALBUQUERQUE FERNANDES. “[en] A STUDY ON UNIT-DEMAND AUCTIONS.” 2006. Web. 16 Jul 2019.

Vancouver:

MAS MAF. [en] A STUDY ON UNIT-DEMAND AUCTIONS. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2006. [cited 2019 Jul 16]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=9208.

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

Council of Science Editors:

MAS MAF. [en] A STUDY ON UNIT-DEMAND AUCTIONS. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2006. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=9208

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

.