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:(Arc Consistency). Showing records 1 – 10 of 10 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Université Catholique de Louvain

1. Mairy, Jean-Baptiste. Propagators for table constraints.

Degree: 2015, Université Catholique de Louvain

 Constraint Programming is devoted to finding solutions to hard combinatorial problems. Such problems usually define exponentially large search spaces. Coping with such search spaces to… (more)

Subjects/Keywords: Constraint Programming; Global Constraints; Table Constraint; Propagation; Generalized Arc Consistency; Smart Table Constraint; Domain k-Wise Consistency

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mairy, J. (2015). Propagators for table constraints. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/160844

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

Mairy, Jean-Baptiste. “Propagators for table constraints.” 2015. Thesis, Université Catholique de Louvain. Accessed October 17, 2019. http://hdl.handle.net/2078.1/160844.

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

MLA Handbook (7th Edition):

Mairy, Jean-Baptiste. “Propagators for table constraints.” 2015. Web. 17 Oct 2019.

Vancouver:

Mairy J. Propagators for table constraints. [Internet] [Thesis]. Université Catholique de Louvain; 2015. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/2078.1/160844.

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

Council of Science Editors:

Mairy J. Propagators for table constraints. [Thesis]. Université Catholique de Louvain; 2015. Available from: http://hdl.handle.net/2078.1/160844

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


KTH

2. Wieweg, William. Towards Arc Consistency in PLAS.

Degree: Electrical Engineering and Computer Science (EECS), 2018, KTH

The Planning And Scheduling (PLAS) module of ICE (Intelligent Control Environment) is responsible for planning and scheduling a large fleet of vehicles. This process… (more)

Subjects/Keywords: Constraint Programming; Scheduling; Planning; Symbolic constraints; Arc consistency; Villkorsprogrammering; Schemaläggning; Planering; Symboliska villkor; Bågkonsekvens; Computer and Information Sciences; Data- och informationsvetenskap

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wieweg, W. (2018). Towards Arc Consistency in PLAS. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-232081

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

Wieweg, William. “Towards Arc Consistency in PLAS.” 2018. Thesis, KTH. Accessed October 17, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-232081.

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

MLA Handbook (7th Edition):

Wieweg, William. “Towards Arc Consistency in PLAS.” 2018. Web. 17 Oct 2019.

Vancouver:

Wieweg W. Towards Arc Consistency in PLAS. [Internet] [Thesis]. KTH; 2018. [cited 2019 Oct 17]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-232081.

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

Council of Science Editors:

Wieweg W. Towards Arc Consistency in PLAS. [Thesis]. KTH; 2018. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-232081

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


University of Toledo

3. BHUJEL, MAN BAHADUR. Performance Enhancement of Data Retrieval from Episodic Memory in Soar Architecture.

Degree: MS, Electrical Engineering, 2018, University of Toledo

 Episodic memory has been the key component of various intelligent and cognitive architecture that includes the autobiographical events of past experiences. The implementation of episodic… (more)

Subjects/Keywords: Electrical Engineering; Soar Architecture; Episodic Retrieval; Base-level Activation; Petrovs Approximation; Structural Graph Matching; Backtracking; Arc-Consistency; Cue-matching

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

BHUJEL, M. B. (2018). Performance Enhancement of Data Retrieval from Episodic Memory in Soar Architecture. (Masters Thesis). University of Toledo. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=toledo1524837171020967

Chicago Manual of Style (16th Edition):

BHUJEL, MAN BAHADUR. “Performance Enhancement of Data Retrieval from Episodic Memory in Soar Architecture.” 2018. Masters Thesis, University of Toledo. Accessed October 17, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1524837171020967.

MLA Handbook (7th Edition):

BHUJEL, MAN BAHADUR. “Performance Enhancement of Data Retrieval from Episodic Memory in Soar Architecture.” 2018. Web. 17 Oct 2019.

Vancouver:

BHUJEL MB. Performance Enhancement of Data Retrieval from Episodic Memory in Soar Architecture. [Internet] [Masters thesis]. University of Toledo; 2018. [cited 2019 Oct 17]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=toledo1524837171020967.

Council of Science Editors:

BHUJEL MB. Performance Enhancement of Data Retrieval from Episodic Memory in Soar Architecture. [Masters Thesis]. University of Toledo; 2018. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=toledo1524837171020967

4. Gantan, Xiaonuo. Empirical evaluation of Soft Arc Consistency algorithms for solving Constraint Optimization Problems.

Degree: 2011, University of Saskatchewan

 A large number of problems in Artificial Intelligence and other areas of science can be viewed as special cases of constraint satisfaction or optimization problems.… (more)

Subjects/Keywords: Constraint Optimization; Soft Arc Consistency; xAC

…VAC VCSP W-AC*2001 WCSP Arc Consistency Arc Consistency during Search Backjumping… …Consistency Existential Arc Consistency Existential Directional Arc Consistency Full Directional Arc… …Satisfaction Problems Maintaining Soft Arc Consistency Node Consistency Non-deterministic Polynomial… …Radio Link Frequency Assignment Problem Radical Pruning Soft Arc Consistency Semiring-based… …Arc Consistency Valued Constraint Satisfaction Problems Weighted Arc Consistency 2001… 

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gantan, X. (2011). Empirical evaluation of Soft Arc Consistency algorithms for solving Constraint Optimization Problems. (Thesis). University of Saskatchewan. Retrieved from http://hdl.handle.net/10388/ETD-2011-08-53

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

Gantan, Xiaonuo. “Empirical evaluation of Soft Arc Consistency algorithms for solving Constraint Optimization Problems.” 2011. Thesis, University of Saskatchewan. Accessed October 17, 2019. http://hdl.handle.net/10388/ETD-2011-08-53.

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

MLA Handbook (7th Edition):

Gantan, Xiaonuo. “Empirical evaluation of Soft Arc Consistency algorithms for solving Constraint Optimization Problems.” 2011. Web. 17 Oct 2019.

Vancouver:

Gantan X. Empirical evaluation of Soft Arc Consistency algorithms for solving Constraint Optimization Problems. [Internet] [Thesis]. University of Saskatchewan; 2011. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/10388/ETD-2011-08-53.

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

Council of Science Editors:

Gantan X. Empirical evaluation of Soft Arc Consistency algorithms for solving Constraint Optimization Problems. [Thesis]. University of Saskatchewan; 2011. Available from: http://hdl.handle.net/10388/ETD-2011-08-53

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

5. Likitvivatanavong, Chavalit. Domain value mutation and other techniques for constraint satisfaction problems.

Degree: 2017, University College Cork

 The term Constraint Satisfaction Problem (CSP) refers to a class of NP-complete problems, a collection of difficult problems for which no fast solution is known.… (more)

Subjects/Keywords: Constraint satisfaction problems; Search; Generalized arc consistency; Interchangeability

…solution — removing one is enough because the other two values would be removed by consistency… …removing inconsistent parts of the CSP to help reduce the search space. Generalized arc… …consistency (GAC) algorithms remove, from the domain of a variable, any value that… …order to establish that the value was arc consistent. Second, the table was static throughout… …the consistency while minimizing the cost of backtracking. As such, unlike most other GAC… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Likitvivatanavong, C. (2017). Domain value mutation and other techniques for constraint satisfaction problems. (Thesis). University College Cork. Retrieved from http://hdl.handle.net/10468/3940

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

Likitvivatanavong, Chavalit. “Domain value mutation and other techniques for constraint satisfaction problems.” 2017. Thesis, University College Cork. Accessed October 17, 2019. http://hdl.handle.net/10468/3940.

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

MLA Handbook (7th Edition):

Likitvivatanavong, Chavalit. “Domain value mutation and other techniques for constraint satisfaction problems.” 2017. Web. 17 Oct 2019.

Vancouver:

Likitvivatanavong C. Domain value mutation and other techniques for constraint satisfaction problems. [Internet] [Thesis]. University College Cork; 2017. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/10468/3940.

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

Council of Science Editors:

Likitvivatanavong C. Domain value mutation and other techniques for constraint satisfaction problems. [Thesis]. University College Cork; 2017. Available from: http://hdl.handle.net/10468/3940

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

6. XIA WEI. Designing and Optimizing Representations for Non-Binary Constraints.

Degree: 2014, National University of Singapore

Subjects/Keywords: generalized arc consistency; compression; table constraint; regular constraint; CSP transformation; higher-order consistencies

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

WEI, X. (2014). Designing and Optimizing Representations for Non-Binary Constraints. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/78953

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

WEI, XIA. “Designing and Optimizing Representations for Non-Binary Constraints.” 2014. Thesis, National University of Singapore. Accessed October 17, 2019. http://scholarbank.nus.edu.sg/handle/10635/78953.

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

MLA Handbook (7th Edition):

WEI, XIA. “Designing and Optimizing Representations for Non-Binary Constraints.” 2014. Web. 17 Oct 2019.

Vancouver:

WEI X. Designing and Optimizing Representations for Non-Binary Constraints. [Internet] [Thesis]. National University of Singapore; 2014. [cited 2019 Oct 17]. Available from: http://scholarbank.nus.edu.sg/handle/10635/78953.

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

Council of Science Editors:

WEI X. Designing and Optimizing Representations for Non-Binary Constraints. [Thesis]. National University of Singapore; 2014. Available from: http://scholarbank.nus.edu.sg/handle/10635/78953

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

7. ZHANG YUANLIN. Consistency techniques in constraint networks.

Degree: 2003, National University of Singapore

Subjects/Keywords: Constraint Networks; Arc Consistency; Set Intersection; Local and Global Consistency; Tree Convexity; Constraint Tightness

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

YUANLIN, Z. (2003). Consistency techniques in constraint networks. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/13502

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

YUANLIN, ZHANG. “Consistency techniques in constraint networks.” 2003. Thesis, National University of Singapore. Accessed October 17, 2019. http://scholarbank.nus.edu.sg/handle/10635/13502.

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

MLA Handbook (7th Edition):

YUANLIN, ZHANG. “Consistency techniques in constraint networks.” 2003. Web. 17 Oct 2019.

Vancouver:

YUANLIN Z. Consistency techniques in constraint networks. [Internet] [Thesis]. National University of Singapore; 2003. [cited 2019 Oct 17]. Available from: http://scholarbank.nus.edu.sg/handle/10635/13502.

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

Council of Science Editors:

YUANLIN Z. Consistency techniques in constraint networks. [Thesis]. National University of Singapore; 2003. Available from: http://scholarbank.nus.edu.sg/handle/10635/13502

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

8. Ahlem, BEN HASSINE. Distributed Reinforcement of Local Consistency for General Constraint Network An Investigation of Meeting Scheduling Problems.

Degree: Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学

Supervisor:Tu Bao HO

知識科学研究科

博士

Subjects/Keywords: Constraint satisfaction problem (CSP), Distributed CSP, Valued CSP, Local consistency, filtering techniques, Arc consistency, Multi-agent systems, Meeting scheduling problems, Asynchronous backtracking techniques; Constraint satisfaction problem (CSP), Distributed CSP, Valued CSP, Local consistency, filtering techniques, Arc consistency, Multi-agent systems, Meeting scheduling problems, Asynchronous backtracking techniques

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ahlem, B. H. (n.d.). Distributed Reinforcement of Local Consistency for General Constraint Network An Investigation of Meeting Scheduling Problems. (Thesis). Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学. Retrieved from http://hdl.handle.net/10119/819

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ahlem, BEN HASSINE. “Distributed Reinforcement of Local Consistency for General Constraint Network An Investigation of Meeting Scheduling Problems.” Thesis, Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学. Accessed October 17, 2019. http://hdl.handle.net/10119/819.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ahlem, BEN HASSINE. “Distributed Reinforcement of Local Consistency for General Constraint Network An Investigation of Meeting Scheduling Problems.” Web. 17 Oct 2019.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Ahlem BH. Distributed Reinforcement of Local Consistency for General Constraint Network An Investigation of Meeting Scheduling Problems. [Internet] [Thesis]. Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学; [cited 2019 Oct 17]. Available from: http://hdl.handle.net/10119/819.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

Ahlem BH. Distributed Reinforcement of Local Consistency for General Constraint Network An Investigation of Meeting Scheduling Problems. [Thesis]. Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学; Available from: http://hdl.handle.net/10119/819

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.


Université Montpellier II

9. Wahbi, Mohamed. Algorithms and ordering heuristics for distributed constraint satisfaction problems : Algorithmes de résolution et heuristiques d'ordonnancement pour les problèmes de satisfaction de contraintes distribués.

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

Les problèmes de satisfaction de contraintes distribués (DisCSP) permettent de formaliser divers problèmes qui se situent dans l'intelligence artificielle distribuée. Ces problèmes consistent à trouver… (more)

Subjects/Keywords: Intelligence Artificielle; Intelligence Artificielle distribuée; Problèmes de satisfaction de contraintes distribués (DisCSP); Heuristiques d'ordonnancement; Maintenance de la consistance d'arc; DisChoco; Artificial Intelligence; Distributed Artificial Intelligence; Distributed Constraint Satisfaction (DisCSP); Reordering; Maintaining Arc Consistency; DisChoco

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wahbi, M. (2012). Algorithms and ordering heuristics for distributed constraint satisfaction problems : Algorithmes de résolution et heuristiques d'ordonnancement pour les problèmes de satisfaction de contraintes distribués. (Doctoral Dissertation). Université Montpellier II. Retrieved from http://www.theses.fr/2012MON20028

Chicago Manual of Style (16th Edition):

Wahbi, Mohamed. “Algorithms and ordering heuristics for distributed constraint satisfaction problems : Algorithmes de résolution et heuristiques d'ordonnancement pour les problèmes de satisfaction de contraintes distribués.” 2012. Doctoral Dissertation, Université Montpellier II. Accessed October 17, 2019. http://www.theses.fr/2012MON20028.

MLA Handbook (7th Edition):

Wahbi, Mohamed. “Algorithms and ordering heuristics for distributed constraint satisfaction problems : Algorithmes de résolution et heuristiques d'ordonnancement pour les problèmes de satisfaction de contraintes distribués.” 2012. Web. 17 Oct 2019.

Vancouver:

Wahbi M. Algorithms and ordering heuristics for distributed constraint satisfaction problems : Algorithmes de résolution et heuristiques d'ordonnancement pour les problèmes de satisfaction de contraintes distribués. [Internet] [Doctoral dissertation]. Université Montpellier II; 2012. [cited 2019 Oct 17]. Available from: http://www.theses.fr/2012MON20028.

Council of Science Editors:

Wahbi M. Algorithms and ordering heuristics for distributed constraint satisfaction problems : Algorithmes de résolution et heuristiques d'ordonnancement pour les problèmes de satisfaction de contraintes distribués. [Doctoral Dissertation]. Université Montpellier II; 2012. Available from: http://www.theses.fr/2012MON20028

10. Μπαλαφούτης, Αθανάσιος. Adaptive strategies for solving contraint satisfaction problems.

Degree: 2011, University of the Aegean; Πανεπιστήμιο Αιγαίου

Subjects/Keywords: Προβλήματα ικανοποίησης περιορισμών; Προσαρμοστικές στρατηγικές; Ευρετικές τεχνικές ταξινόμησης μεταβλητών; Συνέπεια τόξου; Τεχνικές διακλάδωσης δέντρου αναζήτησης; Αυτόνομοι επιλυτές προβλημάτων ικανοποίησης περιορισμών; Constrain satisfaction problems; Adaptive strategies; Variable ordering heuristics; Arc consistency; Revision ordering; Branching schemes; Set branching; Autonomous and adaptive constrain solvers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Μπαλαφούτης, . . (2011). Adaptive strategies for solving contraint satisfaction problems. (Thesis). University of the Aegean; Πανεπιστήμιο Αιγαίου. Retrieved from http://hdl.handle.net/10442/hedi/26336

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

Μπαλαφούτης, Αθανάσιος. “Adaptive strategies for solving contraint satisfaction problems.” 2011. Thesis, University of the Aegean; Πανεπιστήμιο Αιγαίου. Accessed October 17, 2019. http://hdl.handle.net/10442/hedi/26336.

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

MLA Handbook (7th Edition):

Μπαλαφούτης, Αθανάσιος. “Adaptive strategies for solving contraint satisfaction problems.” 2011. Web. 17 Oct 2019.

Vancouver:

Μπαλαφούτης . Adaptive strategies for solving contraint satisfaction problems. [Internet] [Thesis]. University of the Aegean; Πανεπιστήμιο Αιγαίου; 2011. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/10442/hedi/26336.

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

Council of Science Editors:

Μπαλαφούτης . Adaptive strategies for solving contraint satisfaction problems. [Thesis]. University of the Aegean; Πανεπιστήμιο Αιγαίου; 2011. Available from: http://hdl.handle.net/10442/hedi/26336

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

.