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:( constraint satisfaction problems). Showing records 1 – 30 of 18961 total matches.

[1] [2] [3] [4] [5] … [633]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters

1. Schudy, Warren J. Approximation Schemes for Inferring Rankings and Clusterings from Pairwise Data.

Degree: PhD, Computer Science, 2012, Brown University

 In correlation clustering, given similarity or dissimilarity information for all pairs of data items, the goal is to find a clustering of the items into… (more)

Subjects/Keywords: dense constraint satisfaction problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schudy, W. J. (2012). Approximation Schemes for Inferring Rankings and Clusterings from Pairwise Data. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:297610/

Chicago Manual of Style (16th Edition):

Schudy, Warren J. “Approximation Schemes for Inferring Rankings and Clusterings from Pairwise Data.” 2012. Doctoral Dissertation, Brown University. Accessed November 11, 2019. https://repository.library.brown.edu/studio/item/bdr:297610/.

MLA Handbook (7th Edition):

Schudy, Warren J. “Approximation Schemes for Inferring Rankings and Clusterings from Pairwise Data.” 2012. Web. 11 Nov 2019.

Vancouver:

Schudy WJ. Approximation Schemes for Inferring Rankings and Clusterings from Pairwise Data. [Internet] [Doctoral dissertation]. Brown University; 2012. [cited 2019 Nov 11]. Available from: https://repository.library.brown.edu/studio/item/bdr:297610/.

Council of Science Editors:

Schudy WJ. Approximation Schemes for Inferring Rankings and Clusterings from Pairwise Data. [Doctoral Dissertation]. Brown University; 2012. Available from: https://repository.library.brown.edu/studio/item/bdr:297610/


University of Pretoria

2. Smit, Marius. Interactive narrative generation using computational verb theory.

Degree: Computer Science, 2010, University of Pretoria

 Interactive narrative extends traditional story-telling techniques by enabling previously passive observers to become active participants in the narrative events that unfold. A variety of approaches… (more)

Subjects/Keywords: Computational linguistics; Interactive narrative; Constraint satisfaction problems; Fuzzy constraint satisfaction problems; Computer graphics; Fuzzy sets; Computational verb theory; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Smit, M. (2010). Interactive narrative generation using computational verb theory. (Masters Thesis). University of Pretoria. Retrieved from http://hdl.handle.net/2263/27510

Chicago Manual of Style (16th Edition):

Smit, Marius. “Interactive narrative generation using computational verb theory.” 2010. Masters Thesis, University of Pretoria. Accessed November 11, 2019. http://hdl.handle.net/2263/27510.

MLA Handbook (7th Edition):

Smit, Marius. “Interactive narrative generation using computational verb theory.” 2010. Web. 11 Nov 2019.

Vancouver:

Smit M. Interactive narrative generation using computational verb theory. [Internet] [Masters thesis]. University of Pretoria; 2010. [cited 2019 Nov 11]. Available from: http://hdl.handle.net/2263/27510.

Council of Science Editors:

Smit M. Interactive narrative generation using computational verb theory. [Masters Thesis]. University of Pretoria; 2010. Available from: http://hdl.handle.net/2263/27510


University of Pretoria

3. [No author]. Interactive narrative generation using computational verb theory .

Degree: 2010, University of Pretoria

 Interactive narrative extends traditional story-telling techniques by enabling previously passive observers to become active participants in the narrative events that unfold. A variety of approaches… (more)

Subjects/Keywords: Computational linguistics; Interactive narrative; Constraint satisfaction problems; Fuzzy constraint satisfaction problems; Computer graphics; Fuzzy sets; Computational verb theory; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

author], [. (2010). Interactive narrative generation using computational verb theory . (Masters Thesis). University of Pretoria. Retrieved from http://upetd.up.ac.za/thesis/available/etd-08242010-153438/

Chicago Manual of Style (16th Edition):

author], [No. “Interactive narrative generation using computational verb theory .” 2010. Masters Thesis, University of Pretoria. Accessed November 11, 2019. http://upetd.up.ac.za/thesis/available/etd-08242010-153438/.

MLA Handbook (7th Edition):

author], [No. “Interactive narrative generation using computational verb theory .” 2010. Web. 11 Nov 2019.

Vancouver:

author] [. Interactive narrative generation using computational verb theory . [Internet] [Masters thesis]. University of Pretoria; 2010. [cited 2019 Nov 11]. Available from: http://upetd.up.ac.za/thesis/available/etd-08242010-153438/.

Council of Science Editors:

author] [. Interactive narrative generation using computational verb theory . [Masters Thesis]. University of Pretoria; 2010. Available from: http://upetd.up.ac.za/thesis/available/etd-08242010-153438/


Cornell University

4. Gravel, Simon. Using symmmetries to solve asymmetric problems .

Degree: 2008, Cornell University

 This dissertation describes two projects in which the treatment of a difficult and asymmetric problem is simplified by using symmetries of basic building blocks of… (more)

Subjects/Keywords: Constraint satisfaction problems; effective pair potentials; iterated maps; nonlinear perturbation theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gravel, S. (2008). Using symmmetries to solve asymmetric problems . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/11245

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

Gravel, Simon. “Using symmmetries to solve asymmetric problems .” 2008. Thesis, Cornell University. Accessed November 11, 2019. http://hdl.handle.net/1813/11245.

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

MLA Handbook (7th Edition):

Gravel, Simon. “Using symmmetries to solve asymmetric problems .” 2008. Web. 11 Nov 2019.

Vancouver:

Gravel S. Using symmmetries to solve asymmetric problems . [Internet] [Thesis]. Cornell University; 2008. [cited 2019 Nov 11]. Available from: http://hdl.handle.net/1813/11245.

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

Council of Science Editors:

Gravel S. Using symmmetries to solve asymmetric problems . [Thesis]. Cornell University; 2008. Available from: http://hdl.handle.net/1813/11245

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

5. Daoudi, Abderrazak. Acquisition de contraintes par apprentissage de structures : Learning and Using Structures for Constraint Acquisition.

Degree: Docteur es, Informatique, 2016, Montpellier; Université Mohamed V

La Programmation par contraintes est un cadre général utilisé pour modéliser et résoudre des problèmes combinatoires complexes. Cependant, la modélisation d'un problème sous forme d’un… (more)

Subjects/Keywords: Programmation par contraintes; Problèmes de satisfaction de contraintes; Acquisition de contraintes; Structures; Apprentissage automatique; Intelligence artificielle; Constraint Programming; Constraint Satisfaction Problems; Constraint Acquisition; Structures; Machine Learning; Artificiel Intelligence

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Daoudi, A. (2016). Acquisition de contraintes par apprentissage de structures : Learning and Using Structures for Constraint Acquisition. (Doctoral Dissertation). Montpellier; Université Mohamed V. Retrieved from http://www.theses.fr/2016MONTT316

Chicago Manual of Style (16th Edition):

Daoudi, Abderrazak. “Acquisition de contraintes par apprentissage de structures : Learning and Using Structures for Constraint Acquisition.” 2016. Doctoral Dissertation, Montpellier; Université Mohamed V. Accessed November 11, 2019. http://www.theses.fr/2016MONTT316.

MLA Handbook (7th Edition):

Daoudi, Abderrazak. “Acquisition de contraintes par apprentissage de structures : Learning and Using Structures for Constraint Acquisition.” 2016. Web. 11 Nov 2019.

Vancouver:

Daoudi A. Acquisition de contraintes par apprentissage de structures : Learning and Using Structures for Constraint Acquisition. [Internet] [Doctoral dissertation]. Montpellier; Université Mohamed V; 2016. [cited 2019 Nov 11]. Available from: http://www.theses.fr/2016MONTT316.

Council of Science Editors:

Daoudi A. Acquisition de contraintes par apprentissage de structures : Learning and Using Structures for Constraint Acquisition. [Doctoral Dissertation]. Montpellier; Université Mohamed V; 2016. Available from: http://www.theses.fr/2016MONTT316

6. SILVA, Marcos Aurélio Almeida da. CHORD: constraint handling object-oriented rules with disjunctions .

Degree: 2009, Universidade Federal de Pernambuco

Constraint Handling Object-oriented Rules with Disjunctions (CHORD), é uma extensão orientada a objetos (OO) de CHRv, uma linguagem relacional baseada em regras que foi inicialmente… (more)

Subjects/Keywords: Model Driven Approach; Software Engineering; Constraint Satisfaction Problems; Object-oriented Programming; Semantic Web

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

SILVA, M. A. A. d. (2009). CHORD: constraint handling object-oriented rules with disjunctions . (Thesis). Universidade Federal de Pernambuco. Retrieved from http://repositorio.ufpe.br/handle/123456789/1955

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

SILVA, Marcos Aurélio Almeida da. “CHORD: constraint handling object-oriented rules with disjunctions .” 2009. Thesis, Universidade Federal de Pernambuco. Accessed November 11, 2019. http://repositorio.ufpe.br/handle/123456789/1955.

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

MLA Handbook (7th Edition):

SILVA, Marcos Aurélio Almeida da. “CHORD: constraint handling object-oriented rules with disjunctions .” 2009. Web. 11 Nov 2019.

Vancouver:

SILVA MAAd. CHORD: constraint handling object-oriented rules with disjunctions . [Internet] [Thesis]. Universidade Federal de Pernambuco; 2009. [cited 2019 Nov 11]. Available from: http://repositorio.ufpe.br/handle/123456789/1955.

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

Council of Science Editors:

SILVA MAAd. CHORD: constraint handling object-oriented rules with disjunctions . [Thesis]. Universidade Federal de Pernambuco; 2009. Available from: http://repositorio.ufpe.br/handle/123456789/1955

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


Royal Holloway, University of London

7. Kim, Eun Jung. Parameterized algorithms on digraph and constraint satisfaction problems.

Degree: PhD, 2010, Royal Holloway, University of London

 While polynomial-time approximation algorithms remain a dominant notion in tackling computationally hard problems, the framework of parameterized complexity has been emerging rapidly in recent years.… (more)

Subjects/Keywords: 004; Fixed-Parameter Tractability; Algorithm; Graph Theory; Constraint Satisfaction Problems; Computational complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kim, E. J. (2010). Parameterized algorithms on digraph and constraint satisfaction problems. (Doctoral Dissertation). Royal Holloway, University of London. Retrieved from http://repository.royalholloway.ac.uk/items/4e3a1971-6e98-97a9-8e4f-9e1fdc76066a/9/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541502

Chicago Manual of Style (16th Edition):

Kim, Eun Jung. “Parameterized algorithms on digraph and constraint satisfaction problems.” 2010. Doctoral Dissertation, Royal Holloway, University of London. Accessed November 11, 2019. http://repository.royalholloway.ac.uk/items/4e3a1971-6e98-97a9-8e4f-9e1fdc76066a/9/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541502.

MLA Handbook (7th Edition):

Kim, Eun Jung. “Parameterized algorithms on digraph and constraint satisfaction problems.” 2010. Web. 11 Nov 2019.

Vancouver:

Kim EJ. Parameterized algorithms on digraph and constraint satisfaction problems. [Internet] [Doctoral dissertation]. Royal Holloway, University of London; 2010. [cited 2019 Nov 11]. Available from: http://repository.royalholloway.ac.uk/items/4e3a1971-6e98-97a9-8e4f-9e1fdc76066a/9/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541502.

Council of Science Editors:

Kim EJ. Parameterized algorithms on digraph and constraint satisfaction problems. [Doctoral Dissertation]. Royal Holloway, University of London; 2010. Available from: http://repository.royalholloway.ac.uk/items/4e3a1971-6e98-97a9-8e4f-9e1fdc76066a/9/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541502

8. Karoui, Wafa. Méthodes à divergences pour la résolution de problèmes de satisfaction de contraintes et d'optimisation combinatoire : Discrepancy-based search for constraint satisfaction and combinatorial optimisation problems.

Degree: Docteur es, Systèmes industriels, 2010, Toulouse, INSA; Université de Tunis El Manar

Le formalisme « Problème de Satisfaction de Contraintes » (ou CSP pour Constraint Satisfaction Problem) peut être considéré comme un langage de représentation formelle qui… (more)

Subjects/Keywords: Heuristiques; Ordonnancement; Problèmes de satisfaction de contraintes; Recherche arborescente; Recherche à divergences; Heuristics; Scheduling; Constraint Satisfaction Problems; Tree search; Discrepancy search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Karoui, W. (2010). Méthodes à divergences pour la résolution de problèmes de satisfaction de contraintes et d'optimisation combinatoire : Discrepancy-based search for constraint satisfaction and combinatorial optimisation problems. (Doctoral Dissertation). Toulouse, INSA; Université de Tunis El Manar. Retrieved from http://www.theses.fr/2010ISAT0021

Chicago Manual of Style (16th Edition):

Karoui, Wafa. “Méthodes à divergences pour la résolution de problèmes de satisfaction de contraintes et d'optimisation combinatoire : Discrepancy-based search for constraint satisfaction and combinatorial optimisation problems.” 2010. Doctoral Dissertation, Toulouse, INSA; Université de Tunis El Manar. Accessed November 11, 2019. http://www.theses.fr/2010ISAT0021.

MLA Handbook (7th Edition):

Karoui, Wafa. “Méthodes à divergences pour la résolution de problèmes de satisfaction de contraintes et d'optimisation combinatoire : Discrepancy-based search for constraint satisfaction and combinatorial optimisation problems.” 2010. Web. 11 Nov 2019.

Vancouver:

Karoui W. Méthodes à divergences pour la résolution de problèmes de satisfaction de contraintes et d'optimisation combinatoire : Discrepancy-based search for constraint satisfaction and combinatorial optimisation problems. [Internet] [Doctoral dissertation]. Toulouse, INSA; Université de Tunis El Manar; 2010. [cited 2019 Nov 11]. Available from: http://www.theses.fr/2010ISAT0021.

Council of Science Editors:

Karoui W. Méthodes à divergences pour la résolution de problèmes de satisfaction de contraintes et d'optimisation combinatoire : Discrepancy-based search for constraint satisfaction and combinatorial optimisation problems. [Doctoral Dissertation]. Toulouse, INSA; Université de Tunis El Manar; 2010. Available from: http://www.theses.fr/2010ISAT0021

9. Hartmann, Chris. Automatisation de la synthèse d’architectures appliquée aux aéronefs à voilure tournante : Automated architecture synthesis applied to rotary-wing aircrafts.

Degree: Docteur es, Productique - Mécanique, 2018, Ecole centrale de Nantes

Les travaux, présentés dans ce manuscrit de thèse, s’inscrivent dans les courants de l’Ingénierie Système et de la synthèse assistée par ordinateur. Une méthodologie outillée… (more)

Subjects/Keywords: Ingénierie système; Satisfaction de problèmes sous contraintes; Architecture; Synthèse; System engineering; Constraint satisfaction problems; Architecture; Synthesis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hartmann, C. (2018). Automatisation de la synthèse d’architectures appliquée aux aéronefs à voilure tournante : Automated architecture synthesis applied to rotary-wing aircrafts. (Doctoral Dissertation). Ecole centrale de Nantes. Retrieved from http://www.theses.fr/2018ECDN0002

Chicago Manual of Style (16th Edition):

Hartmann, Chris. “Automatisation de la synthèse d’architectures appliquée aux aéronefs à voilure tournante : Automated architecture synthesis applied to rotary-wing aircrafts.” 2018. Doctoral Dissertation, Ecole centrale de Nantes. Accessed November 11, 2019. http://www.theses.fr/2018ECDN0002.

MLA Handbook (7th Edition):

Hartmann, Chris. “Automatisation de la synthèse d’architectures appliquée aux aéronefs à voilure tournante : Automated architecture synthesis applied to rotary-wing aircrafts.” 2018. Web. 11 Nov 2019.

Vancouver:

Hartmann C. Automatisation de la synthèse d’architectures appliquée aux aéronefs à voilure tournante : Automated architecture synthesis applied to rotary-wing aircrafts. [Internet] [Doctoral dissertation]. Ecole centrale de Nantes; 2018. [cited 2019 Nov 11]. Available from: http://www.theses.fr/2018ECDN0002.

Council of Science Editors:

Hartmann C. Automatisation de la synthèse d’architectures appliquée aux aéronefs à voilure tournante : Automated architecture synthesis applied to rotary-wing aircrafts. [Doctoral Dissertation]. Ecole centrale de Nantes; 2018. Available from: http://www.theses.fr/2018ECDN0002


INP Toulouse

10. Xiong, Jun. Set-membership state estimation and application on fault detection : Estimations ensemblistes des états et application à la détection.

Degree: Docteur es, Systèmes automatiques, 2013, INP Toulouse

La modélisation des systèmes dynamiques requiert la prise en compte d’incertitudes liées à l’existence inévitable de bruits (bruits de mesure, bruits sur la dynamique), à… (more)

Subjects/Keywords: Analyse par intervalles; Filtrage de Kalman; Détection de défauts; State estimation; Linear model; Constraint satisfaction problems; Uncertain dynamic systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xiong, J. (2013). Set-membership state estimation and application on fault detection : Estimations ensemblistes des états et application à la détection. (Doctoral Dissertation). INP Toulouse. Retrieved from http://www.theses.fr/2013INPT0001

Chicago Manual of Style (16th Edition):

Xiong, Jun. “Set-membership state estimation and application on fault detection : Estimations ensemblistes des états et application à la détection.” 2013. Doctoral Dissertation, INP Toulouse. Accessed November 11, 2019. http://www.theses.fr/2013INPT0001.

MLA Handbook (7th Edition):

Xiong, Jun. “Set-membership state estimation and application on fault detection : Estimations ensemblistes des états et application à la détection.” 2013. Web. 11 Nov 2019.

Vancouver:

Xiong J. Set-membership state estimation and application on fault detection : Estimations ensemblistes des états et application à la détection. [Internet] [Doctoral dissertation]. INP Toulouse; 2013. [cited 2019 Nov 11]. Available from: http://www.theses.fr/2013INPT0001.

Council of Science Editors:

Xiong J. Set-membership state estimation and application on fault detection : Estimations ensemblistes des états et application à la détection. [Doctoral Dissertation]. INP Toulouse; 2013. Available from: http://www.theses.fr/2013INPT0001

11. Vautard, Jérémie. Modélisation et résolution de problèmes de décision et d'optimisation hiérarchiques en utilisant des contraintes quantifiées : Decision and hierarchical optimisation problem modeling and solving by use of quantified contraints.

Degree: Docteur es, Informatique, 2010, Université d'Orléans

Cette thèse s’inscrit dans le cadre de la programmation par contraintes quantifiées, un formalisme étendantla programmation par contraintes classique en ajoutant aux variables des quantificateurs… (more)

Subjects/Keywords: Programmation par contraintes quantifiées; Optimisation multi-niveaux; Problèmes PSPACEcomplets; Quantified constraint satisfaction programming; Multi-level optimization; PSPACE-complete problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vautard, J. (2010). Modélisation et résolution de problèmes de décision et d'optimisation hiérarchiques en utilisant des contraintes quantifiées : Decision and hierarchical optimisation problem modeling and solving by use of quantified contraints. (Doctoral Dissertation). Université d'Orléans. Retrieved from http://www.theses.fr/2010ORLE2008

Chicago Manual of Style (16th Edition):

Vautard, Jérémie. “Modélisation et résolution de problèmes de décision et d'optimisation hiérarchiques en utilisant des contraintes quantifiées : Decision and hierarchical optimisation problem modeling and solving by use of quantified contraints.” 2010. Doctoral Dissertation, Université d'Orléans. Accessed November 11, 2019. http://www.theses.fr/2010ORLE2008.

MLA Handbook (7th Edition):

Vautard, Jérémie. “Modélisation et résolution de problèmes de décision et d'optimisation hiérarchiques en utilisant des contraintes quantifiées : Decision and hierarchical optimisation problem modeling and solving by use of quantified contraints.” 2010. Web. 11 Nov 2019.

Vancouver:

Vautard J. Modélisation et résolution de problèmes de décision et d'optimisation hiérarchiques en utilisant des contraintes quantifiées : Decision and hierarchical optimisation problem modeling and solving by use of quantified contraints. [Internet] [Doctoral dissertation]. Université d'Orléans; 2010. [cited 2019 Nov 11]. Available from: http://www.theses.fr/2010ORLE2008.

Council of Science Editors:

Vautard J. Modélisation et résolution de problèmes de décision et d'optimisation hiérarchiques en utilisant des contraintes quantifiées : Decision and hierarchical optimisation problem modeling and solving by use of quantified contraints. [Doctoral Dissertation]. Université d'Orléans; 2010. Available from: http://www.theses.fr/2010ORLE2008


Universidade Nova

12. Saleh, Amr Hany. Constraint reasoning with local search for continuous optimization.

Degree: 2014, Universidade Nova

 Optimization is a very important field for getting the best possible value for the optimization function. Continuous optimization is optimization over real intervals. There are… (more)

Subjects/Keywords: Optimization; Constraint satisfaction; Local search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Saleh, A. H. (2014). Constraint reasoning with local search for continuous optimization. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/13253

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

Saleh, Amr Hany. “Constraint reasoning with local search for continuous optimization.” 2014. Thesis, Universidade Nova. Accessed November 11, 2019. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/13253.

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

MLA Handbook (7th Edition):

Saleh, Amr Hany. “Constraint reasoning with local search for continuous optimization.” 2014. Web. 11 Nov 2019.

Vancouver:

Saleh AH. Constraint reasoning with local search for continuous optimization. [Internet] [Thesis]. Universidade Nova; 2014. [cited 2019 Nov 11]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/13253.

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

Council of Science Editors:

Saleh AH. Constraint reasoning with local search for continuous optimization. [Thesis]. Universidade Nova; 2014. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/13253

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


Université Paris-Sud – Paris XI

13. Arbelaez Rodriguez, Alejandro. Learning during search : Apprendre durant la recherche combinatoire.

Degree: Docteur es, Informatique, 2011, Université Paris-Sud – Paris XI

La recherche autonome est un nouveau domaine d'intérêt de la programmation par contraintes, motivé par l'importance reconnue de l'utilisation de l'apprentissage automatique pour le problème… (more)

Subjects/Keywords: Portfolio d'algorithmes; Apprentissage Automatique; Apprentissage Supervisée; Problèmes de satisfaction de contraintes; Problèmes d'optimisation de combinatoire; SAT; Recherche locale; Portfolio Algorithms; Machine Learning; Supervised Learning; Constraint Satisfaction Problems; Constraint Optimization Problems; SAT; Local Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Arbelaez Rodriguez, A. (2011). Learning during search : Apprendre durant la recherche combinatoire. (Doctoral Dissertation). Université Paris-Sud – Paris XI. Retrieved from http://www.theses.fr/2011PA112063

Chicago Manual of Style (16th Edition):

Arbelaez Rodriguez, Alejandro. “Learning during search : Apprendre durant la recherche combinatoire.” 2011. Doctoral Dissertation, Université Paris-Sud – Paris XI. Accessed November 11, 2019. http://www.theses.fr/2011PA112063.

MLA Handbook (7th Edition):

Arbelaez Rodriguez, Alejandro. “Learning during search : Apprendre durant la recherche combinatoire.” 2011. Web. 11 Nov 2019.

Vancouver:

Arbelaez Rodriguez A. Learning during search : Apprendre durant la recherche combinatoire. [Internet] [Doctoral dissertation]. Université Paris-Sud – Paris XI; 2011. [cited 2019 Nov 11]. Available from: http://www.theses.fr/2011PA112063.

Council of Science Editors:

Arbelaez Rodriguez A. Learning during search : Apprendre durant la recherche combinatoire. [Doctoral Dissertation]. Université Paris-Sud – Paris XI; 2011. Available from: http://www.theses.fr/2011PA112063

14. Climent Aunés, Laura Isabel. Robustness and stability in dynamic constraint satisfaction problems .

Degree: 2014, Universitat Politècnica de València

Constraint programming is a paradigm wherein relations between variables are stated in the form of constraints. It is well-known that many real life problems can… (more)

Subjects/Keywords: Robustness; Stability; Uncertainty; Dynamism; Constraint Satisfaction Problems; CSPs; Dynamic Constraint Satisfaction Problems; DynCSP

Page 1 Page 2

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Climent Aunés, L. I. (2014). Robustness and stability in dynamic constraint satisfaction problems . (Doctoral Dissertation). Universitat Politècnica de València. Retrieved from http://hdl.handle.net/10251/34785

Chicago Manual of Style (16th Edition):

Climent Aunés, Laura Isabel. “Robustness and stability in dynamic constraint satisfaction problems .” 2014. Doctoral Dissertation, Universitat Politècnica de València. Accessed November 11, 2019. http://hdl.handle.net/10251/34785.

MLA Handbook (7th Edition):

Climent Aunés, Laura Isabel. “Robustness and stability in dynamic constraint satisfaction problems .” 2014. Web. 11 Nov 2019.

Vancouver:

Climent Aunés LI. Robustness and stability in dynamic constraint satisfaction problems . [Internet] [Doctoral dissertation]. Universitat Politècnica de València; 2014. [cited 2019 Nov 11]. Available from: http://hdl.handle.net/10251/34785.

Council of Science Editors:

Climent Aunés LI. Robustness and stability in dynamic constraint satisfaction problems . [Doctoral Dissertation]. Universitat Politècnica de València; 2014. Available from: http://hdl.handle.net/10251/34785

15. Schmidt, Hinnerk Christian. Statistical Physics of Sparse and Dense Models in Optimization and Inference : Physique statistique des modèles épars et denses en optimisation et inférence.

Degree: Docteur es, Physique, 2018, Paris Saclay

Une donnée peut avoir diverses formes et peut provenir d'un large panel d'applications. Habituellement, une donnée possède beaucoup de bruit et peut être soumise aux… (more)

Subjects/Keywords: Systèmes désordonnés; Verres de spin; Inférence bayésienne; Graphe aléatoire; Problème de satisfaction de contraintes; Disordered systems; Spin glasses; Bayesian inference; Random graphs; Constraint satisfaction problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schmidt, H. C. (2018). Statistical Physics of Sparse and Dense Models in Optimization and Inference : Physique statistique des modèles épars et denses en optimisation et inférence. (Doctoral Dissertation). Paris Saclay. Retrieved from http://www.theses.fr/2018SACLS366

Chicago Manual of Style (16th Edition):

Schmidt, Hinnerk Christian. “Statistical Physics of Sparse and Dense Models in Optimization and Inference : Physique statistique des modèles épars et denses en optimisation et inférence.” 2018. Doctoral Dissertation, Paris Saclay. Accessed November 11, 2019. http://www.theses.fr/2018SACLS366.

MLA Handbook (7th Edition):

Schmidt, Hinnerk Christian. “Statistical Physics of Sparse and Dense Models in Optimization and Inference : Physique statistique des modèles épars et denses en optimisation et inférence.” 2018. Web. 11 Nov 2019.

Vancouver:

Schmidt HC. Statistical Physics of Sparse and Dense Models in Optimization and Inference : Physique statistique des modèles épars et denses en optimisation et inférence. [Internet] [Doctoral dissertation]. Paris Saclay; 2018. [cited 2019 Nov 11]. Available from: http://www.theses.fr/2018SACLS366.

Council of Science Editors:

Schmidt HC. Statistical Physics of Sparse and Dense Models in Optimization and Inference : Physique statistique des modèles épars et denses en optimisation et inférence. [Doctoral Dissertation]. Paris Saclay; 2018. Available from: http://www.theses.fr/2018SACLS366


University of Guelph

16. Mohamed, Younis. An Empirical Study of Distributed Constraint Satisfaction Algorithms .

Degree: 2011, University of Guelph

 Many real world problems are naturally distributed, whether they are spatially, cognitively, or otherwise. Distributed problems naturally lend themselves to solutions using multi-agent paradigms. Distributed… (more)

Subjects/Keywords: Multi-Agents; Empirical Study; Multiply-Sectioned Constraint Networks (MSCNs); Constraint Satisfaction; Distributed Constraint Satisfaction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mohamed, Y. (2011). An Empirical Study of Distributed Constraint Satisfaction Algorithms . (Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/3038

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

Mohamed, Younis. “An Empirical Study of Distributed Constraint Satisfaction Algorithms .” 2011. Thesis, University of Guelph. Accessed November 11, 2019. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/3038.

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

MLA Handbook (7th Edition):

Mohamed, Younis. “An Empirical Study of Distributed Constraint Satisfaction Algorithms .” 2011. Web. 11 Nov 2019.

Vancouver:

Mohamed Y. An Empirical Study of Distributed Constraint Satisfaction Algorithms . [Internet] [Thesis]. University of Guelph; 2011. [cited 2019 Nov 11]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/3038.

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

Council of Science Editors:

Mohamed Y. An Empirical Study of Distributed Constraint Satisfaction Algorithms . [Thesis]. University of Guelph; 2011. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/3038

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


Vanderbilt University

17. White, Christopher Jules. Optimizing the Configuration of Software Product Line Variants.

Degree: PhD, Computer Science, 2008, Vanderbilt University

 Software Product-Lines (SPLs) are software architectures that provide reusable components that can be configured into variants to meet different requirement sets. A key part of… (more)

Subjects/Keywords: software product-lines; heuristic algorithms; constraint satisfaction problems; constraint programming; configuration; optimization; Software product line engineering; Constraint programming (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

White, C. J. (2008). Optimizing the Configuration of Software Product Line Variants. (Doctoral Dissertation). Vanderbilt University. Retrieved from http://etd.library.vanderbilt.edu/available/etd-11052008-174438/ ;

Chicago Manual of Style (16th Edition):

White, Christopher Jules. “Optimizing the Configuration of Software Product Line Variants.” 2008. Doctoral Dissertation, Vanderbilt University. Accessed November 11, 2019. http://etd.library.vanderbilt.edu/available/etd-11052008-174438/ ;.

MLA Handbook (7th Edition):

White, Christopher Jules. “Optimizing the Configuration of Software Product Line Variants.” 2008. Web. 11 Nov 2019.

Vancouver:

White CJ. Optimizing the Configuration of Software Product Line Variants. [Internet] [Doctoral dissertation]. Vanderbilt University; 2008. [cited 2019 Nov 11]. Available from: http://etd.library.vanderbilt.edu/available/etd-11052008-174438/ ;.

Council of Science Editors:

White CJ. Optimizing the Configuration of Software Product Line Variants. [Doctoral Dissertation]. Vanderbilt University; 2008. Available from: http://etd.library.vanderbilt.edu/available/etd-11052008-174438/ ;


Universidad de Murcia

18. Morales Nicolás, Antonio. Razonamiento espacial cualitativo con relaciones cardinales basado en problemas de satisfacción de restricciones y lógicas modales.

Degree: Departamento de Ingeniería de la Información y las Comunicaciones, 2010, Universidad de Murcia

 The main goal of this PhD Thesis is to propose improvements to existing models for qualitative spatial reasoning with cardinal direction relations, and to propose… (more)

Subjects/Keywords: Modal Logics; Constraint Satisfaction Problems; Lógicas Modales Qualitative Spatial Reasoning; Problemas de Satisfacción de Restricciones; Razonamiento Espacial Cualitativo; Inteligencia Artificial; 004; 16; 512

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Morales Nicolás, A. (2010). Razonamiento espacial cualitativo con relaciones cardinales basado en problemas de satisfacción de restricciones y lógicas modales. (Thesis). Universidad de Murcia. Retrieved from http://hdl.handle.net/10803/10933

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

Morales Nicolás, Antonio. “Razonamiento espacial cualitativo con relaciones cardinales basado en problemas de satisfacción de restricciones y lógicas modales.” 2010. Thesis, Universidad de Murcia. Accessed November 11, 2019. http://hdl.handle.net/10803/10933.

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

MLA Handbook (7th Edition):

Morales Nicolás, Antonio. “Razonamiento espacial cualitativo con relaciones cardinales basado en problemas de satisfacción de restricciones y lógicas modales.” 2010. Web. 11 Nov 2019.

Vancouver:

Morales Nicolás A. Razonamiento espacial cualitativo con relaciones cardinales basado en problemas de satisfacción de restricciones y lógicas modales. [Internet] [Thesis]. Universidad de Murcia; 2010. [cited 2019 Nov 11]. Available from: http://hdl.handle.net/10803/10933.

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

Council of Science Editors:

Morales Nicolás A. Razonamiento espacial cualitativo con relaciones cardinales basado en problemas de satisfacción de restricciones y lógicas modales. [Thesis]. Universidad de Murcia; 2010. Available from: http://hdl.handle.net/10803/10933

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

19. Camacho, David. A simple CSP-based model for unmanned air vehicle mission planning.

Degree: 2018, Institute of Electrical and Electronics Engineers

Subjects/Keywords: Backtracking; Mission Planning; Temporal Constraint Satisfaction Problems; Unmanned Aircraft Systems; Informática

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Camacho, D. (2018). A simple CSP-based model for unmanned air vehicle mission planning. (Thesis). Institute of Electrical and Electronics Engineers. Retrieved from http://hdl.handle.net/10486/664975

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

Camacho, David. “A simple CSP-based model for unmanned air vehicle mission planning.” 2018. Thesis, Institute of Electrical and Electronics Engineers. Accessed November 11, 2019. http://hdl.handle.net/10486/664975.

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

MLA Handbook (7th Edition):

Camacho, David. “A simple CSP-based model for unmanned air vehicle mission planning.” 2018. Web. 11 Nov 2019.

Vancouver:

Camacho D. A simple CSP-based model for unmanned air vehicle mission planning. [Internet] [Thesis]. Institute of Electrical and Electronics Engineers; 2018. [cited 2019 Nov 11]. Available from: http://hdl.handle.net/10486/664975.

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

Council of Science Editors:

Camacho D. A simple CSP-based model for unmanned air vehicle mission planning. [Thesis]. Institute of Electrical and Electronics Engineers; 2018. Available from: http://hdl.handle.net/10486/664975

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

20. Camacho, David. Branching to find feasible solutions in unmanned air vehicle mission planning.

Degree: 2018, Springer Berlin Heidelberg

Subjects/Keywords: Unmanned aircraft systems; Mission planning; Temporal constraint satisfaction problems; Branch and bound; Informática

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Camacho, D. (2018). Branching to find feasible solutions in unmanned air vehicle mission planning. (Thesis). Springer Berlin Heidelberg. Retrieved from http://hdl.handle.net/10486/664809

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

Camacho, David. “Branching to find feasible solutions in unmanned air vehicle mission planning.” 2018. Thesis, Springer Berlin Heidelberg. Accessed November 11, 2019. http://hdl.handle.net/10486/664809.

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

MLA Handbook (7th Edition):

Camacho, David. “Branching to find feasible solutions in unmanned air vehicle mission planning.” 2018. Web. 11 Nov 2019.

Vancouver:

Camacho D. Branching to find feasible solutions in unmanned air vehicle mission planning. [Internet] [Thesis]. Springer Berlin Heidelberg; 2018. [cited 2019 Nov 11]. Available from: http://hdl.handle.net/10486/664809.

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

Council of Science Editors:

Camacho D. Branching to find feasible solutions in unmanned air vehicle mission planning. [Thesis]. Springer Berlin Heidelberg; 2018. Available from: http://hdl.handle.net/10486/664809

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


University of Vienna

21. Domes, Ferenc. Rigorous techniques for continuous constraint satisfaction problems.

Degree: 2010, University of Vienna

Diese Arbeit beschäftigt sich mit rigorosen Techniken für das Lösen kontinuierlicher Zulässigkeitsprobleme. Das heißt, wir suchen nach einem oder allen Punkte, genannt zulässige Punkte, die… (more)

Subjects/Keywords: 31.76 Numerische Mathematik; 31.80 Angewandte Mathematik; kontinuierliche Zulässigkeitsprobleme / rigorose Methoden / quadratische Nebenbedingungen / Optimierung / numerische Mathematik; continuous constraint satisfaction problems / rigorous techniques / quadratic constraints / optmiziation / numerical mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Domes, F. (2010). Rigorous techniques for continuous constraint satisfaction problems. (Thesis). University of Vienna. Retrieved from http://othes.univie.ac.at/10626/

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

Domes, Ferenc. “Rigorous techniques for continuous constraint satisfaction problems.” 2010. Thesis, University of Vienna. Accessed November 11, 2019. http://othes.univie.ac.at/10626/.

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

MLA Handbook (7th Edition):

Domes, Ferenc. “Rigorous techniques for continuous constraint satisfaction problems.” 2010. Web. 11 Nov 2019.

Vancouver:

Domes F. Rigorous techniques for continuous constraint satisfaction problems. [Internet] [Thesis]. University of Vienna; 2010. [cited 2019 Nov 11]. Available from: http://othes.univie.ac.at/10626/.

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

Council of Science Editors:

Domes F. Rigorous techniques for continuous constraint satisfaction problems. [Thesis]. University of Vienna; 2010. Available from: http://othes.univie.ac.at/10626/

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

22. 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

…Domain Value Mutation and other techniques for Constraint Satisfaction Problems vi 135 136… …techniques for Constraint Satisfaction Problems viii List of Algorithms List of Algorithms 1 2… …techniques for Constraint Satisfaction Problems viii I, Chavalit Likitvivatanavong, certify that… …x28;if there is any). 1. “Domain Transmutation in Constraint Satisfaction Problems… …Satisfaction Problems xii Chapter 1 Introduction The term Constraint Satisfaction Problem (… 

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 November 11, 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. 11 Nov 2019.

Vancouver:

Likitvivatanavong C. Domain value mutation and other techniques for constraint satisfaction problems. [Internet] [Thesis]. University College Cork; 2017. [cited 2019 Nov 11]. 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

23. Fast, Andrew Scott. Learning the Structure of Bayesian Networks with Constraint Satisfaction.

Degree: PhD, Computer Science, 2010, U of Massachusetts : PhD

 A Bayesian network is graphical representation of the probabilistic relationships among set of variables and can be used to encode expert knowledge about uncertain domains.… (more)

Subjects/Keywords: Bayesian networks; Constraint satisfaction; Constraint-based; Structure learning; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fast, A. S. (2010). Learning the Structure of Bayesian Networks with Constraint Satisfaction. (Doctoral Dissertation). U of Massachusetts : PhD. Retrieved from https://scholarworks.umass.edu/open_access_dissertations/182

Chicago Manual of Style (16th Edition):

Fast, Andrew Scott. “Learning the Structure of Bayesian Networks with Constraint Satisfaction.” 2010. Doctoral Dissertation, U of Massachusetts : PhD. Accessed November 11, 2019. https://scholarworks.umass.edu/open_access_dissertations/182.

MLA Handbook (7th Edition):

Fast, Andrew Scott. “Learning the Structure of Bayesian Networks with Constraint Satisfaction.” 2010. Web. 11 Nov 2019.

Vancouver:

Fast AS. Learning the Structure of Bayesian Networks with Constraint Satisfaction. [Internet] [Doctoral dissertation]. U of Massachusetts : PhD; 2010. [cited 2019 Nov 11]. Available from: https://scholarworks.umass.edu/open_access_dissertations/182.

Council of Science Editors:

Fast AS. Learning the Structure of Bayesian Networks with Constraint Satisfaction. [Doctoral Dissertation]. U of Massachusetts : PhD; 2010. Available from: https://scholarworks.umass.edu/open_access_dissertations/182


Delft University of Technology

24. Ten Thije, J.O.A. Towards a Dynamic Algorithm for the Simple Temporal Problem:.

Degree: 2011, Delft University of Technology

 Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, many solvers employ a heuristic-driven… (more)

Subjects/Keywords: Constraint Satisfaction; Simple Temporal Problem; Scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ten Thije, J. O. A. (2011). Towards a Dynamic Algorithm for the Simple Temporal Problem:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:bb91b0cf-9ce5-4470-a326-b61885d34988

Chicago Manual of Style (16th Edition):

Ten Thije, J O A. “Towards a Dynamic Algorithm for the Simple Temporal Problem:.” 2011. Masters Thesis, Delft University of Technology. Accessed November 11, 2019. http://resolver.tudelft.nl/uuid:bb91b0cf-9ce5-4470-a326-b61885d34988.

MLA Handbook (7th Edition):

Ten Thije, J O A. “Towards a Dynamic Algorithm for the Simple Temporal Problem:.” 2011. Web. 11 Nov 2019.

Vancouver:

Ten Thije JOA. Towards a Dynamic Algorithm for the Simple Temporal Problem:. [Internet] [Masters thesis]. Delft University of Technology; 2011. [cited 2019 Nov 11]. Available from: http://resolver.tudelft.nl/uuid:bb91b0cf-9ce5-4470-a326-b61885d34988.

Council of Science Editors:

Ten Thije JOA. Towards a Dynamic Algorithm for the Simple Temporal Problem:. [Masters Thesis]. Delft University of Technology; 2011. Available from: http://resolver.tudelft.nl/uuid:bb91b0cf-9ce5-4470-a326-b61885d34988


University of Oxford

25. Petke, Justyna. On the bridge between constraint satisfaction and Boolean satisfiability.

Degree: PhD, 2012, University of Oxford

 A wide range of problems can be formalized as a set of constraints that need to be satisfied. In fact, such a model is called… (more)

Subjects/Keywords: 511.324; Computer Science; constraint satisfaction; Boolean satisfiability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Petke, J. (2012). On the bridge between constraint satisfaction and Boolean satisfiability. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:53bf6d0e-74eb-4c50-a1a2-c8da6773beae ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572891

Chicago Manual of Style (16th Edition):

Petke, Justyna. “On the bridge between constraint satisfaction and Boolean satisfiability.” 2012. Doctoral Dissertation, University of Oxford. Accessed November 11, 2019. http://ora.ox.ac.uk/objects/uuid:53bf6d0e-74eb-4c50-a1a2-c8da6773beae ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572891.

MLA Handbook (7th Edition):

Petke, Justyna. “On the bridge between constraint satisfaction and Boolean satisfiability.” 2012. Web. 11 Nov 2019.

Vancouver:

Petke J. On the bridge between constraint satisfaction and Boolean satisfiability. [Internet] [Doctoral dissertation]. University of Oxford; 2012. [cited 2019 Nov 11]. Available from: http://ora.ox.ac.uk/objects/uuid:53bf6d0e-74eb-4c50-a1a2-c8da6773beae ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572891.

Council of Science Editors:

Petke J. On the bridge between constraint satisfaction and Boolean satisfiability. [Doctoral Dissertation]. University of Oxford; 2012. Available from: http://ora.ox.ac.uk/objects/uuid:53bf6d0e-74eb-4c50-a1a2-c8da6773beae ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572891

26. Woodward, Robert J. Les cohérences fortes : où, quand, et combien : Higher-Level Consistencies : When, Where, and How Much.

Degree: Docteur es, Informatique, 2018, Montpellier; University of Nebraska-Lincoln

Déterminer si un problème de satisfaction de contraintes (CSP) a une solution ou non est NP-complet. Les CSP sont résolus par inférence (c’est-à-dire, en appliquant… (more)

Subjects/Keywords: Cohérence; Propagation des contraintes; Satisfaction des contraintes; Consistency; Constraint Propagation; Constraint Satisfaction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Woodward, R. J. (2018). Les cohérences fortes : où, quand, et combien : Higher-Level Consistencies : When, Where, and How Much. (Doctoral Dissertation). Montpellier; University of Nebraska-Lincoln. Retrieved from http://www.theses.fr/2018MONTS145

Chicago Manual of Style (16th Edition):

Woodward, Robert J. “Les cohérences fortes : où, quand, et combien : Higher-Level Consistencies : When, Where, and How Much.” 2018. Doctoral Dissertation, Montpellier; University of Nebraska-Lincoln. Accessed November 11, 2019. http://www.theses.fr/2018MONTS145.

MLA Handbook (7th Edition):

Woodward, Robert J. “Les cohérences fortes : où, quand, et combien : Higher-Level Consistencies : When, Where, and How Much.” 2018. Web. 11 Nov 2019.

Vancouver:

Woodward RJ. Les cohérences fortes : où, quand, et combien : Higher-Level Consistencies : When, Where, and How Much. [Internet] [Doctoral dissertation]. Montpellier; University of Nebraska-Lincoln; 2018. [cited 2019 Nov 11]. Available from: http://www.theses.fr/2018MONTS145.

Council of Science Editors:

Woodward RJ. Les cohérences fortes : où, quand, et combien : Higher-Level Consistencies : When, Where, and How Much. [Doctoral Dissertation]. Montpellier; University of Nebraska-Lincoln; 2018. Available from: http://www.theses.fr/2018MONTS145


INP Toulouse

27. Abeille, Joël. Vers un couplage des processus de conception de systèmes et de planification de projets : formalisation de connaissances méthodologiques et de connaissances métier : Towards a coupling of system design and project planning processes : formalization of methodological knowledge and business knowledge.

Degree: Docteur es, Systèmes Industriels, 2011, INP Toulouse

Les travaux présentés dans cette thèse s'inscrivent dans une problématique d'aide à la conception de systèmes, à la planification de leur projet de développement et… (more)

Subjects/Keywords: Ingénierie Système; Conception; Planification; Couplage conception/planification; Raisonnement à Partir de Cas; Problèmes de Satisfaction de Contraintes; Ingénierie des Connaissances; System Engineering; Design; Planning; Design/Planning Coupling; Case-Based Reasoning; Constraint Satisfaction Problems; Knowledge Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Abeille, J. (2011). Vers un couplage des processus de conception de systèmes et de planification de projets : formalisation de connaissances méthodologiques et de connaissances métier : Towards a coupling of system design and project planning processes : formalization of methodological knowledge and business knowledge. (Doctoral Dissertation). INP Toulouse. Retrieved from http://www.theses.fr/2011INPT0051

Chicago Manual of Style (16th Edition):

Abeille, Joël. “Vers un couplage des processus de conception de systèmes et de planification de projets : formalisation de connaissances méthodologiques et de connaissances métier : Towards a coupling of system design and project planning processes : formalization of methodological knowledge and business knowledge.” 2011. Doctoral Dissertation, INP Toulouse. Accessed November 11, 2019. http://www.theses.fr/2011INPT0051.

MLA Handbook (7th Edition):

Abeille, Joël. “Vers un couplage des processus de conception de systèmes et de planification de projets : formalisation de connaissances méthodologiques et de connaissances métier : Towards a coupling of system design and project planning processes : formalization of methodological knowledge and business knowledge.” 2011. Web. 11 Nov 2019.

Vancouver:

Abeille J. Vers un couplage des processus de conception de systèmes et de planification de projets : formalisation de connaissances méthodologiques et de connaissances métier : Towards a coupling of system design and project planning processes : formalization of methodological knowledge and business knowledge. [Internet] [Doctoral dissertation]. INP Toulouse; 2011. [cited 2019 Nov 11]. Available from: http://www.theses.fr/2011INPT0051.

Council of Science Editors:

Abeille J. Vers un couplage des processus de conception de systèmes et de planification de projets : formalisation de connaissances méthodologiques et de connaissances métier : Towards a coupling of system design and project planning processes : formalization of methodological knowledge and business knowledge. [Doctoral Dissertation]. INP Toulouse; 2011. Available from: http://www.theses.fr/2011INPT0051


Université Catholique de Louvain

28. Zoetardt, Geoffroy. Interface and application of constraint programming for musical composition.

Degree: 2016, Université Catholique de Louvain

This master's thesis aims to interface and apply the constraint programming to a software of musical composition: OpenMusic. It interfaces a constraint programming system Gecode… (more)

Subjects/Keywords: Constraint programming; GeLisp; Gecode; OpenMusic; Musical composition; Relational constraint programming; Interface; Application; Lisp; Musical constraint satisfaction problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zoetardt, G. (2016). Interface and application of constraint programming for musical composition. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/thesis:8113

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

Zoetardt, Geoffroy. “Interface and application of constraint programming for musical composition.” 2016. Thesis, Université Catholique de Louvain. Accessed November 11, 2019. http://hdl.handle.net/2078.1/thesis:8113.

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

MLA Handbook (7th Edition):

Zoetardt, Geoffroy. “Interface and application of constraint programming for musical composition.” 2016. Web. 11 Nov 2019.

Vancouver:

Zoetardt G. Interface and application of constraint programming for musical composition. [Internet] [Thesis]. Université Catholique de Louvain; 2016. [cited 2019 Nov 11]. Available from: http://hdl.handle.net/2078.1/thesis:8113.

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

Council of Science Editors:

Zoetardt G. Interface and application of constraint programming for musical composition. [Thesis]. Université Catholique de Louvain; 2016. Available from: http://hdl.handle.net/2078.1/thesis:8113

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

29. Higa, Carlos Henrique Aguena. Inferência de redes de regulação gênica utilizando o paradigma de crescimento de sementes.

Degree: PhD, Ciência da Computação, 2012, University of São Paulo

Um problema importante na área de Biologia Sistêmica é o de inferência de redes de regulação gênica. Os avanços científicos e tecnológicos nos permitem analisar… (more)

Subjects/Keywords: Boolean networks; cadeia de Markov; constraint satisfaction problems; feature selection; gene regulatory networks; inference; inferência de redes; Markov chain; problemas de satisfação de restrições; redes Booleanas; redes de regulação gênica; seleção de características

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Higa, C. H. A. (2012). Inferência de redes de regulação gênica utilizando o paradigma de crescimento de sementes. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-06092012-144108/ ;

Chicago Manual of Style (16th Edition):

Higa, Carlos Henrique Aguena. “Inferência de redes de regulação gênica utilizando o paradigma de crescimento de sementes.” 2012. Doctoral Dissertation, University of São Paulo. Accessed November 11, 2019. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-06092012-144108/ ;.

MLA Handbook (7th Edition):

Higa, Carlos Henrique Aguena. “Inferência de redes de regulação gênica utilizando o paradigma de crescimento de sementes.” 2012. Web. 11 Nov 2019.

Vancouver:

Higa CHA. Inferência de redes de regulação gênica utilizando o paradigma de crescimento de sementes. [Internet] [Doctoral dissertation]. University of São Paulo; 2012. [cited 2019 Nov 11]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-06092012-144108/ ;.

Council of Science Editors:

Higa CHA. Inferência de redes de regulação gênica utilizando o paradigma de crescimento de sementes. [Doctoral Dissertation]. University of São Paulo; 2012. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-06092012-144108/ ;

30. Paparrizou, Anastasia. Efficient algorithms for strong local consistencies and adaptive techniques in constraint satisfaction problems.

Degree: 2013, University of Western Macedonia; Πανεπιστήμιο Δυτικής Μακεδονίας

Constraint Programming (CP) is a successful technology for solving a wide range of problemsin business and industry which require the satisfaction of a set of… (more)

Subjects/Keywords: Ισχυρές τοπικές συνέπειες; Προσαρμοστικές τεχνικές; Ισχυρή συνέπεια ορίων; Τεχνικές διάδοσης περιορισμών; Αλγόριθμοι φιλτραρίσματος; Προβλήματα ικανοποίησης περιορισμών; Strong local consistencies; Higher-order consistencies; Adaptive techniques; Strong bounds consistency; Table constraints; Filtering algorithms; Constraint satisfaction problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Paparrizou, A. (2013). Efficient algorithms for strong local consistencies and adaptive techniques in constraint satisfaction problems. (Thesis). University of Western Macedonia; Πανεπιστήμιο Δυτικής Μακεδονίας. Retrieved from http://hdl.handle.net/10442/hedi/31791

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

Paparrizou, Anastasia. “Efficient algorithms for strong local consistencies and adaptive techniques in constraint satisfaction problems.” 2013. Thesis, University of Western Macedonia; Πανεπιστήμιο Δυτικής Μακεδονίας. Accessed November 11, 2019. http://hdl.handle.net/10442/hedi/31791.

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

MLA Handbook (7th Edition):

Paparrizou, Anastasia. “Efficient algorithms for strong local consistencies and adaptive techniques in constraint satisfaction problems.” 2013. Web. 11 Nov 2019.

Vancouver:

Paparrizou A. Efficient algorithms for strong local consistencies and adaptive techniques in constraint satisfaction problems. [Internet] [Thesis]. University of Western Macedonia; Πανεπιστήμιο Δυτικής Μακεδονίας; 2013. [cited 2019 Nov 11]. Available from: http://hdl.handle.net/10442/hedi/31791.

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

Council of Science Editors:

Paparrizou A. Efficient algorithms for strong local consistencies and adaptive techniques in constraint satisfaction problems. [Thesis]. University of Western Macedonia; Πανεπιστήμιο Δυτικής Μακεδονίας; 2013. Available from: http://hdl.handle.net/10442/hedi/31791

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

[1] [2] [3] [4] [5] … [633]

.