Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Constraint satisfaction)`

.
Showing records 1 – 30 of
134 total matches.

Search Limiters

Dates

- 2016 – 2020 (38)
- 2011 – 2015 (49)
- 2006 – 2010 (29)
- 2001 – 2005 (15)

Degrees

- PhD (31)
- Docteur es (21)

Country

- US (31)
- France (21)
- Canada (17)
- Czech Republic (10)

▼ Search Limiters

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

Degree: PhD, Computer Science, 2012, Brown University

URL: https://repository.library.brown.edu/studio/item/bdr:297610/

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Schudy, Warren J. “Approximation Schemes for Inferring Rankings and Clusterings from Pairwise Data.” 2012. Web. 04 Dec 2020.

Vancouver:

Schudy WJ. Approximation Schemes for Inferring Rankings and Clusterings from Pairwise Data. [Internet] [Doctoral dissertation]. Brown University; 2012. [cited 2020 Dec 04]. 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/

Universidade Nova

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

Degree: 2014, Universidade Nova

URL: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/13253

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

Saleh, Amr Hany. “Constraint reasoning with local search for continuous optimization.” 2014. Thesis, Universidade Nova. Accessed December 04, 2020. 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 (7^{th} Edition):

Saleh, Amr Hany. “Constraint reasoning with local search for continuous optimization.” 2014. Web. 04 Dec 2020.

Vancouver:

Saleh AH. Constraint reasoning with local search for continuous optimization. [Internet] [Thesis]. Universidade Nova; 2014. [cited 2020 Dec 04]. 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

Not specified: Masters Thesis or Doctoral Dissertation

University of Guelph

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

Degree: Master of Applied Science, Department of Computing and Information Science, 2011, University of Guelph

URL: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/3038

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Chicago Manual of Style (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Mohamed, Younis. “An Empirical Study of Distributed Constraint Satisfaction Algorithms.” 2011. Web. 04 Dec 2020.

Vancouver:

Mohamed Y. An Empirical Study of Distributed Constraint Satisfaction Algorithms. [Internet] [Masters thesis]. University of Guelph; 2011. [cited 2020 Dec 04]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/3038.

Council of Science Editors:

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

University of Oxford

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

Degree: PhD, 2012, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:53bf6d0e-74eb-4c50-a1a2-c8da6773beae ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572891

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

Petke, Justyna. “On the bridge between constraint satisfaction and Boolean satisfiability.” 2012. Doctoral Dissertation, University of Oxford. Accessed December 04, 2020. 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 (7^{th} Edition):

Petke, Justyna. “On the bridge between constraint satisfaction and Boolean satisfiability.” 2012. Web. 04 Dec 2020.

Vancouver:

Petke J. On the bridge between constraint satisfaction and Boolean satisfiability. [Internet] [Doctoral dissertation]. University of Oxford; 2012. [cited 2020 Dec 04]. 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

Delft University of Technology

5. Ten Thije, J.O.A. (author). Towards a Dynamic Algorithm for the Simple Temporal Problem.

Degree: 2011, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:bb91b0cf-9ce5-4470-a326-b61885d34988

►

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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Ten Thije, J O A (author). “Towards a Dynamic Algorithm for the Simple Temporal Problem.” 2011. Web. 04 Dec 2020.

Vancouver:

Ten Thije JOA(. Towards a Dynamic Algorithm for the Simple Temporal Problem. [Internet] [Masters thesis]. Delft University of Technology; 2011. [cited 2020 Dec 04]. 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 Toronto

6. Erdem, Ozan. Exploring a Two-Solver Architecture for Clause Learning CSP Solvers.

Degree: PhD, 2017, University of Toronto

URL: http://hdl.handle.net/1807/78955

► Many real world problems can be encoded as *Constraint* *Satisfaction* Problems (CSPs). *Constraint* *satisfaction* problems contain variables over finite domains, as well as constraints over…
(more)

Subjects/Keywords: Constraint Satisfaction Problems; Satisfiability Problem; Search; 0800

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Erdem, O. (2017). Exploring a Two-Solver Architecture for Clause Learning CSP Solvers. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/78955

Chicago Manual of Style (16^{th} Edition):

Erdem, Ozan. “Exploring a Two-Solver Architecture for Clause Learning CSP Solvers.” 2017. Doctoral Dissertation, University of Toronto. Accessed December 04, 2020. http://hdl.handle.net/1807/78955.

MLA Handbook (7^{th} Edition):

Erdem, Ozan. “Exploring a Two-Solver Architecture for Clause Learning CSP Solvers.” 2017. Web. 04 Dec 2020.

Vancouver:

Erdem O. Exploring a Two-Solver Architecture for Clause Learning CSP Solvers. [Internet] [Doctoral dissertation]. University of Toronto; 2017. [cited 2020 Dec 04]. Available from: http://hdl.handle.net/1807/78955.

Council of Science Editors:

Erdem O. Exploring a Two-Solver Architecture for Clause Learning CSP Solvers. [Doctoral Dissertation]. University of Toronto; 2017. Available from: http://hdl.handle.net/1807/78955

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

URL: http://www.theses.fr/2018MONTS145

►

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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} 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 December 04, 2020. http://www.theses.fr/2018MONTS145.

MLA Handbook (7^{th} Edition):

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

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 2020 Dec 04]. 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

University of Pretoria

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

Degree: 2010, University of Pretoria

URL: http://upetd.up.ac.za/thesis/available/etd-08242010-153438/

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

author], [No. “Interactive narrative generation using computational verb theory .” 2010. Web. 04 Dec 2020.

Vancouver:

author] [. Interactive narrative generation using computational verb theory . [Internet] [Masters thesis]. University of Pretoria; 2010. [cited 2020 Dec 04]. 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/

University of Pretoria

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

Degree: Computer Science, 2010, University of Pretoria

URL: http://hdl.handle.net/2263/27510

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Smit, Marius. “Interactive narrative generation using computational verb theory.” 2010. Web. 04 Dec 2020.

Vancouver:

Smit M. Interactive narrative generation using computational verb theory. [Internet] [Masters thesis]. University of Pretoria; 2010. [cited 2020 Dec 04]. 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

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

URL: http://www.theses.fr/2016MONTT316

►

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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} 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 December 04, 2020. http://www.theses.fr/2016MONTT316.

MLA Handbook (7^{th} Edition):

Daoudi, Abderrazak. “Acquisition de contraintes par apprentissage de structures : Learning and Using Structures for Constraint Acquisition.” 2016. Web. 04 Dec 2020.

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 2020 Dec 04]. 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

Brigham Young University

11. Bodily, Paul Mark. Machine Learning for Inspired, Structured, Lyrical Music Composition.

Degree: PhD, 2018, Brigham Young University

URL: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=7930&context=etd

► Computational creativity has been called the "final frontier" of artificial intelligence due to the difficulty inherent in defining and implementing creativity in computational systems. Despite…
(more)

Subjects/Keywords: Machine Learning; Markov Processes; Constraint Satisfaction; Computational Creativity; Computer Sciences

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bodily, P. M. (2018). Machine Learning for Inspired, Structured, Lyrical Music Composition. (Doctoral Dissertation). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=7930&context=etd

Chicago Manual of Style (16^{th} Edition):

Bodily, Paul Mark. “Machine Learning for Inspired, Structured, Lyrical Music Composition.” 2018. Doctoral Dissertation, Brigham Young University. Accessed December 04, 2020. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=7930&context=etd.

MLA Handbook (7^{th} Edition):

Bodily, Paul Mark. “Machine Learning for Inspired, Structured, Lyrical Music Composition.” 2018. Web. 04 Dec 2020.

Vancouver:

Bodily PM. Machine Learning for Inspired, Structured, Lyrical Music Composition. [Internet] [Doctoral dissertation]. Brigham Young University; 2018. [cited 2020 Dec 04]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=7930&context=etd.

Council of Science Editors:

Bodily PM. Machine Learning for Inspired, Structured, Lyrical Music Composition. [Doctoral Dissertation]. Brigham Young University; 2018. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=7930&context=etd

12.
Wang, Pengming.
Descriptive complexity of *constraint* problems.

Degree: PhD, 2018, University of Cambridge

URL: https://doi.org/10.17863/CAM.23470 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.744877

► *Constraint* problems are a powerful framework in which many common combinatorial problems can be expressed. Examples include graph colouring problems, Boolean *satisfaction*, graph cut problems,…
(more)

Subjects/Keywords: 005.1; Complexity theory; Constraint satisfaction; Logic; Computer science; Optimisation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wang, P. (2018). Descriptive complexity of constraint problems. (Doctoral Dissertation). University of Cambridge. Retrieved from https://doi.org/10.17863/CAM.23470 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.744877

Chicago Manual of Style (16^{th} Edition):

Wang, Pengming. “Descriptive complexity of constraint problems.” 2018. Doctoral Dissertation, University of Cambridge. Accessed December 04, 2020. https://doi.org/10.17863/CAM.23470 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.744877.

MLA Handbook (7^{th} Edition):

Wang, Pengming. “Descriptive complexity of constraint problems.” 2018. Web. 04 Dec 2020.

Vancouver:

Wang P. Descriptive complexity of constraint problems. [Internet] [Doctoral dissertation]. University of Cambridge; 2018. [cited 2020 Dec 04]. Available from: https://doi.org/10.17863/CAM.23470 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.744877.

Council of Science Editors:

Wang P. Descriptive complexity of constraint problems. [Doctoral Dissertation]. University of Cambridge; 2018. Available from: https://doi.org/10.17863/CAM.23470 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.744877

University of Notre Dame

13.
Melinda Varga.
Continuous-Time Dynamical Systems Approach to Hard
*Constraint* *Satisfaction* Problems</h1>.

Degree: Physics, 2017, University of Notre Dame

URL: https://curate.nd.edu/show/0c483j35215

► There are many problems that cannot be solved with today’s digital computers. One of the most studied such problems is Boolean satisfiability (k-SAT), which…
(more)

Subjects/Keywords: constraint satisfaction problem; k-SAT; dynamical system; transient chaos; Boolean satisfiability

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Varga, M. (2017). Continuous-Time Dynamical Systems Approach to Hard Constraint Satisfaction Problems</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/0c483j35215

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Varga, Melinda. “Continuous-Time Dynamical Systems Approach to Hard Constraint Satisfaction Problems</h1>.” 2017. Thesis, University of Notre Dame. Accessed December 04, 2020. https://curate.nd.edu/show/0c483j35215.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Varga, Melinda. “Continuous-Time Dynamical Systems Approach to Hard Constraint Satisfaction Problems</h1>.” 2017. Web. 04 Dec 2020.

Vancouver:

Varga M. Continuous-Time Dynamical Systems Approach to Hard Constraint Satisfaction Problems</h1>. [Internet] [Thesis]. University of Notre Dame; 2017. [cited 2020 Dec 04]. Available from: https://curate.nd.edu/show/0c483j35215.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Varga M. Continuous-Time Dynamical Systems Approach to Hard Constraint Satisfaction Problems</h1>. [Thesis]. University of Notre Dame; 2017. Available from: https://curate.nd.edu/show/0c483j35215

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

14. Ekpenyong, Olufisayo. Parallel Pattern Search in Large, Partial-Order Data Sets on Multi-core Systems.

Degree: 2011, University of Waterloo

URL: http://hdl.handle.net/10012/5740

► Monitoring and debugging distributed systems is inherently a difficult problem. Events collected during the execution of distributed systems can enable developers to diagnose and fix…
(more)

Subjects/Keywords: parallel search; constraint satisfaction problem; distributed debbugging; monitoring distributed systems

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ekpenyong, O. (2011). Parallel Pattern Search in Large, Partial-Order Data Sets on Multi-core Systems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5740

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Ekpenyong, Olufisayo. “Parallel Pattern Search in Large, Partial-Order Data Sets on Multi-core Systems.” 2011. Thesis, University of Waterloo. Accessed December 04, 2020. http://hdl.handle.net/10012/5740.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ekpenyong, Olufisayo. “Parallel Pattern Search in Large, Partial-Order Data Sets on Multi-core Systems.” 2011. Web. 04 Dec 2020.

Vancouver:

Ekpenyong O. Parallel Pattern Search in Large, Partial-Order Data Sets on Multi-core Systems. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2020 Dec 04]. Available from: http://hdl.handle.net/10012/5740.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ekpenyong O. Parallel Pattern Search in Large, Partial-Order Data Sets on Multi-core Systems. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/5740

Not specified: Masters Thesis or Doctoral Dissertation

University of Georgia

15. Taylor, Christopher Allen. A comprehensive framework for the snake-in-the-box problem.

Degree: 2014, University of Georgia

URL: http://hdl.handle.net/10724/24514

► The snake-in-the-box problem was posed by Kautz [5] in the context of coding theory in 1958 and is essentially the problem of finding the longest…
(more)

Subjects/Keywords: Hypercube; Heuristic Search; Graph Theory; Visualization; Constraint Satisfaction

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Taylor, C. A. (2014). A comprehensive framework for the snake-in-the-box problem. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/24514

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Taylor, Christopher Allen. “A comprehensive framework for the snake-in-the-box problem.” 2014. Thesis, University of Georgia. Accessed December 04, 2020. http://hdl.handle.net/10724/24514.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Taylor, Christopher Allen. “A comprehensive framework for the snake-in-the-box problem.” 2014. Web. 04 Dec 2020.

Vancouver:

Taylor CA. A comprehensive framework for the snake-in-the-box problem. [Internet] [Thesis]. University of Georgia; 2014. [cited 2020 Dec 04]. Available from: http://hdl.handle.net/10724/24514.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Taylor CA. A comprehensive framework for the snake-in-the-box problem. [Thesis]. University of Georgia; 2014. Available from: http://hdl.handle.net/10724/24514

Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

16. -8689-6770. Strong lower bounds on generic convex relaxations.

Degree: PhD, Computer science, 2016, University of Texas – Austin

URL: http://hdl.handle.net/2152/44040

► Despite significant successes in understanding the hardness of computational problems based on standard assumptions such as P != NP, there are important settings where the…
(more)

Subjects/Keywords: Lower bounds; Semidefinite programming; Planted clique; Constraint satisfaction

Record Details Similar Records

❌

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

APA (6^{th} Edition):

-8689-6770. (2016). Strong lower bounds on generic convex relaxations. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/44040

Note: this citation may be lacking information needed for this citation format:

Author name may be incomplete

Chicago Manual of Style (16^{th} Edition):

-8689-6770. “Strong lower bounds on generic convex relaxations.” 2016. Doctoral Dissertation, University of Texas – Austin. Accessed December 04, 2020. http://hdl.handle.net/2152/44040.

Note: this citation may be lacking information needed for this citation format:

Author name may be incomplete

MLA Handbook (7^{th} Edition):

-8689-6770. “Strong lower bounds on generic convex relaxations.” 2016. Web. 04 Dec 2020.

Note: this citation may be lacking information needed for this citation format:

Author name may be incomplete

Vancouver:

-8689-6770. Strong lower bounds on generic convex relaxations. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2016. [cited 2020 Dec 04]. Available from: http://hdl.handle.net/2152/44040.

Author name may be incomplete

Council of Science Editors:

-8689-6770. Strong lower bounds on generic convex relaxations. [Doctoral Dissertation]. University of Texas – Austin; 2016. Available from: http://hdl.handle.net/2152/44040

Author name may be incomplete

Mississippi State University

17.
Lawrence, Joseph Britto.
G+: A *CONSTRAINT*-BASED SYSTEM FOR GEOMETRIC MODELING.

Degree: MS, Computational Engineering, 2002, Mississippi State University

URL: http://sun.library.msstate.edu/ETD-db/theses/available/etd-07092002-204335/ ;

► Most commercial CAD systems do not offer sufficient support for the design activity. The reason is that they cannot understand the functional requirements of the…
(more)

Subjects/Keywords: constraint consistency; non-linear constraints; GGCL.; constraint satisfaction

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lawrence, J. B. (2002). G+: A CONSTRAINT-BASED SYSTEM FOR GEOMETRIC MODELING. (Masters Thesis). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-07092002-204335/ ;

Chicago Manual of Style (16^{th} Edition):

Lawrence, Joseph Britto. “G+: A CONSTRAINT-BASED SYSTEM FOR GEOMETRIC MODELING.” 2002. Masters Thesis, Mississippi State University. Accessed December 04, 2020. http://sun.library.msstate.edu/ETD-db/theses/available/etd-07092002-204335/ ;.

MLA Handbook (7^{th} Edition):

Lawrence, Joseph Britto. “G+: A CONSTRAINT-BASED SYSTEM FOR GEOMETRIC MODELING.” 2002. Web. 04 Dec 2020.

Vancouver:

Lawrence JB. G+: A CONSTRAINT-BASED SYSTEM FOR GEOMETRIC MODELING. [Internet] [Masters thesis]. Mississippi State University; 2002. [cited 2020 Dec 04]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-07092002-204335/ ;.

Council of Science Editors:

Lawrence JB. G+: A CONSTRAINT-BASED SYSTEM FOR GEOMETRIC MODELING. [Masters Thesis]. Mississippi State University; 2002. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-07092002-204335/ ;

18.
Lennartz, P.M.
No-Wait Job Shop Scheduling, a *Constraint* Propagation Approach.

Degree: 2006, University Utrecht

URL: https://dspace.library.uu.nl/handle/1874/12286 ; URN:NBN:NL:UI:10-1874-12286 ; URN:NBN:NL:UI:10-1874-12286 ; https://dspace.library.uu.nl/handle/1874/12286

► Multi-machine scheduling problems have earned themselves a reputation of intractability. In this thesis we try to solve a special kind of these problems, the so-called…
(more)

Subjects/Keywords: constraint propagation; constraint satisfaction; no-wait job shop scheduling

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lennartz, P. M. (2006). No-Wait Job Shop Scheduling, a Constraint Propagation Approach. (Doctoral Dissertation). University Utrecht. Retrieved from https://dspace.library.uu.nl/handle/1874/12286 ; URN:NBN:NL:UI:10-1874-12286 ; URN:NBN:NL:UI:10-1874-12286 ; https://dspace.library.uu.nl/handle/1874/12286

Chicago Manual of Style (16^{th} Edition):

Lennartz, P M. “No-Wait Job Shop Scheduling, a Constraint Propagation Approach.” 2006. Doctoral Dissertation, University Utrecht. Accessed December 04, 2020. https://dspace.library.uu.nl/handle/1874/12286 ; URN:NBN:NL:UI:10-1874-12286 ; URN:NBN:NL:UI:10-1874-12286 ; https://dspace.library.uu.nl/handle/1874/12286.

MLA Handbook (7^{th} Edition):

Lennartz, P M. “No-Wait Job Shop Scheduling, a Constraint Propagation Approach.” 2006. Web. 04 Dec 2020.

Vancouver:

Lennartz PM. No-Wait Job Shop Scheduling, a Constraint Propagation Approach. [Internet] [Doctoral dissertation]. University Utrecht; 2006. [cited 2020 Dec 04]. Available from: https://dspace.library.uu.nl/handle/1874/12286 ; URN:NBN:NL:UI:10-1874-12286 ; URN:NBN:NL:UI:10-1874-12286 ; https://dspace.library.uu.nl/handle/1874/12286.

Council of Science Editors:

Lennartz PM. No-Wait Job Shop Scheduling, a Constraint Propagation Approach. [Doctoral Dissertation]. University Utrecht; 2006. Available from: https://dspace.library.uu.nl/handle/1874/12286 ; URN:NBN:NL:UI:10-1874-12286 ; URN:NBN:NL:UI:10-1874-12286 ; https://dspace.library.uu.nl/handle/1874/12286

19. Paris, Nicolas. Intégration de techniques CSP pour la résolution du problème WCSP : Integration of CSP techniques to solve WCSP.

Degree: Docteur es, Informatique, 2014, Université d'Artois

URL: http://www.theses.fr/2014ARTO0405

►

Cette thèse se situe dans le contexte de la programmation par contraintes (CP). Plus précisément, nous nous sommes intéressés au problème de *satisfaction* de contraintes…
(more)

Subjects/Keywords: Intelligence artificielle; Programmation par contraintes; Problème de satisfaction de contraintes pondérées; Problème de satisfaction de contraintes; Réduction tabulaire simple; Noyau insatisfaisable minimal; Artificial intelligence; Constraint programming; Weighted constraint satisfaction problem; Constraint satisfaction problem; Simple tabular reduction; Minimal unsatisfiable core; 006.3

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Paris, N. (2014). Intégration de techniques CSP pour la résolution du problème WCSP : Integration of CSP techniques to solve WCSP. (Doctoral Dissertation). Université d'Artois. Retrieved from http://www.theses.fr/2014ARTO0405

Chicago Manual of Style (16^{th} Edition):

Paris, Nicolas. “Intégration de techniques CSP pour la résolution du problème WCSP : Integration of CSP techniques to solve WCSP.” 2014. Doctoral Dissertation, Université d'Artois. Accessed December 04, 2020. http://www.theses.fr/2014ARTO0405.

MLA Handbook (7^{th} Edition):

Paris, Nicolas. “Intégration de techniques CSP pour la résolution du problème WCSP : Integration of CSP techniques to solve WCSP.” 2014. Web. 04 Dec 2020.

Vancouver:

Paris N. Intégration de techniques CSP pour la résolution du problème WCSP : Integration of CSP techniques to solve WCSP. [Internet] [Doctoral dissertation]. Université d'Artois; 2014. [cited 2020 Dec 04]. Available from: http://www.theses.fr/2014ARTO0405.

Council of Science Editors:

Paris N. Intégration de techniques CSP pour la résolution du problème WCSP : Integration of CSP techniques to solve WCSP. [Doctoral Dissertation]. Université d'Artois; 2014. Available from: http://www.theses.fr/2014ARTO0405

20.
Blet, Loïc.
Configuration automatique d’un solveur générique intégrant des techniques de décomposition arborescente pour la résolution de problèmes de *satisfaction* de contraintes : Automatic configuration of generic solver embedding tree-decomposition techniques for solving *constraint* *satisfaction* problems.

Degree: Docteur es, Informatique, 2015, INSA Lyon

URL: http://www.theses.fr/2015ISAL0085

►

La programmation par contraintes intègre des algorithmes de résolution génériques dans des langages de modélisation déclaratifs basés sur les contraintes : ces langages permettent de… (more)

Subjects/Keywords: Informatique; Problème de satisfaction de contrainte; Programmation par contrainte; Intelligence artificielle; Apprentissage; IT - Information technology; CSP - Constraint Satisfaction Problem; Constraint programming; Artificial intelligence; Learning; 006.307 2

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Blet, L. (2015). Configuration automatique d’un solveur générique intégrant des techniques de décomposition arborescente pour la résolution de problèmes de satisfaction de contraintes : Automatic configuration of generic solver embedding tree-decomposition techniques for solving constraint satisfaction problems. (Doctoral Dissertation). INSA Lyon. Retrieved from http://www.theses.fr/2015ISAL0085

Chicago Manual of Style (16^{th} Edition):

Blet, Loïc. “Configuration automatique d’un solveur générique intégrant des techniques de décomposition arborescente pour la résolution de problèmes de satisfaction de contraintes : Automatic configuration of generic solver embedding tree-decomposition techniques for solving constraint satisfaction problems.” 2015. Doctoral Dissertation, INSA Lyon. Accessed December 04, 2020. http://www.theses.fr/2015ISAL0085.

MLA Handbook (7^{th} Edition):

Blet, Loïc. “Configuration automatique d’un solveur générique intégrant des techniques de décomposition arborescente pour la résolution de problèmes de satisfaction de contraintes : Automatic configuration of generic solver embedding tree-decomposition techniques for solving constraint satisfaction problems.” 2015. Web. 04 Dec 2020.

Vancouver:

Blet L. Configuration automatique d’un solveur générique intégrant des techniques de décomposition arborescente pour la résolution de problèmes de satisfaction de contraintes : Automatic configuration of generic solver embedding tree-decomposition techniques for solving constraint satisfaction problems. [Internet] [Doctoral dissertation]. INSA Lyon; 2015. [cited 2020 Dec 04]. Available from: http://www.theses.fr/2015ISAL0085.

Council of Science Editors:

Blet L. Configuration automatique d’un solveur générique intégrant des techniques de décomposition arborescente pour la résolution de problèmes de satisfaction de contraintes : Automatic configuration of generic solver embedding tree-decomposition techniques for solving constraint satisfaction problems. [Doctoral Dissertation]. INSA Lyon; 2015. Available from: http://www.theses.fr/2015ISAL0085

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

Degree: 2009, Universidade Federal de Pernambuco

URL: http://repositorio.ufpe.br/handle/123456789/1955

► *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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

SILVA, Marcos Aurélio Almeida da. “CHORD: constraint handling object-oriented rules with disjunctions .” 2009. Web. 04 Dec 2020.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

Carnegie Mellon University

22.
Wu, Yi.
The Approximability of Learning and *Constraint* *Satisfaction* Problems.

Degree: 2010, Carnegie Mellon University

URL: http://repository.cmu.edu/dissertations/24

► An α-approximation algorithm is an algorithm guaranteed to output a solutionthat is within an α ratio of the optimal solution. We are interested in thefollowing…
(more)

Subjects/Keywords: Complexity Theory; Approximation Algorithm; Computational Learning; Constraint Satisfaction Problem; Hardness of Approximation; Semidefinite Programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wu, Y. (2010). The Approximability of Learning and Constraint Satisfaction Problems. (Thesis). Carnegie Mellon University. Retrieved from http://repository.cmu.edu/dissertations/24

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Wu, Yi. “The Approximability of Learning and Constraint Satisfaction Problems.” 2010. Thesis, Carnegie Mellon University. Accessed December 04, 2020. http://repository.cmu.edu/dissertations/24.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wu, Yi. “The Approximability of Learning and Constraint Satisfaction Problems.” 2010. Web. 04 Dec 2020.

Vancouver:

Wu Y. The Approximability of Learning and Constraint Satisfaction Problems. [Internet] [Thesis]. Carnegie Mellon University; 2010. [cited 2020 Dec 04]. Available from: http://repository.cmu.edu/dissertations/24.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wu Y. The Approximability of Learning and Constraint Satisfaction Problems. [Thesis]. Carnegie Mellon University; 2010. Available from: http://repository.cmu.edu/dissertations/24

Not specified: Masters Thesis or Doctoral Dissertation

23. Kallus, Yoav. Solving Geometric Puzzles With Divide And Concur.

Degree: PhD, Physics, 2011, Cornell University

URL: http://hdl.handle.net/1813/30782

► In this dissertation we discuss a variety of geometric *constraint* *satisfaction* problems. The greatest part of the discussion is devoted to infinite packing problems, where…
(more)

Subjects/Keywords: packing; constraint satisfaction; structure determination

…problems of geometric
*constraint* *satisfaction*. Though in each of the following chapters we… …problems
of *constraint* *satisfaction*. Additionally, in all but the last chapter we use the Divide… …geometric *constraint* *satisfaction* problems arise and then some of the many
considerations which… …geometric *constraint* *satisfaction* problems take the form of puzzles: the problem consists of… …direct type of *constraint* *satisfaction* problem where
the structure is the physical result of…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kallus, Y. (2011). Solving Geometric Puzzles With Divide And Concur. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/30782

Chicago Manual of Style (16^{th} Edition):

Kallus, Yoav. “Solving Geometric Puzzles With Divide And Concur.” 2011. Doctoral Dissertation, Cornell University. Accessed December 04, 2020. http://hdl.handle.net/1813/30782.

MLA Handbook (7^{th} Edition):

Kallus, Yoav. “Solving Geometric Puzzles With Divide And Concur.” 2011. Web. 04 Dec 2020.

Vancouver:

Kallus Y. Solving Geometric Puzzles With Divide And Concur. [Internet] [Doctoral dissertation]. Cornell University; 2011. [cited 2020 Dec 04]. Available from: http://hdl.handle.net/1813/30782.

Council of Science Editors:

Kallus Y. Solving Geometric Puzzles With Divide And Concur. [Doctoral Dissertation]. Cornell University; 2011. Available from: http://hdl.handle.net/1813/30782

24. Kormann, Benjamin. Automatische Testdatengenerierung zur Absicherung fehlerbehafteter reaktiver Automatisierungssysteme.

Degree: 2016, Technische Universität Dortmund

URL: https://doi.org/10.21268/20161212-141647 ; https://nbn-resolving.org/urn:nbn:de:gbv:104-20161222-085708-6 ; https://dokumente.ub.tu-clausthal.de/receive/clausthal_mods_00000427 ; https://dokumente.ub.tu-clausthal.de/servlets/MCRFileNodeServlet/clausthal_derivate_00000206/Db%20112974.pdf

►

Durch den steigenden Funktionsumfang moderner Maschinen und Anlagen erhöht sich insbesondere die Komplexität der Steuerungssoftware. Der Test im Allgemeinen und der SPS Steuerungssoftware im Speziellen,… (more)

Subjects/Keywords: Abschlussarbeit; doctoral thesis; ddc:004; SPS-Steuerungssoftware – Laufzeitverhalten – Constraint Satisfaction Problem (CSP) – Testr

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kormann, B. (2016). Automatische Testdatengenerierung zur Absicherung fehlerbehafteter reaktiver Automatisierungssysteme. (Thesis). Technische Universität Dortmund. Retrieved from https://doi.org/10.21268/20161212-141647 ; https://nbn-resolving.org/urn:nbn:de:gbv:104-20161222-085708-6 ; https://dokumente.ub.tu-clausthal.de/receive/clausthal_mods_00000427 ; https://dokumente.ub.tu-clausthal.de/servlets/MCRFileNodeServlet/clausthal_derivate_00000206/Db%20112974.pdf

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Kormann, Benjamin. “Automatische Testdatengenerierung zur Absicherung fehlerbehafteter reaktiver Automatisierungssysteme.” 2016. Thesis, Technische Universität Dortmund. Accessed December 04, 2020. https://doi.org/10.21268/20161212-141647 ; https://nbn-resolving.org/urn:nbn:de:gbv:104-20161222-085708-6 ; https://dokumente.ub.tu-clausthal.de/receive/clausthal_mods_00000427 ; https://dokumente.ub.tu-clausthal.de/servlets/MCRFileNodeServlet/clausthal_derivate_00000206/Db%20112974.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kormann, Benjamin. “Automatische Testdatengenerierung zur Absicherung fehlerbehafteter reaktiver Automatisierungssysteme.” 2016. Web. 04 Dec 2020.

Vancouver:

Kormann B. Automatische Testdatengenerierung zur Absicherung fehlerbehafteter reaktiver Automatisierungssysteme. [Internet] [Thesis]. Technische Universität Dortmund; 2016. [cited 2020 Dec 04]. Available from: https://doi.org/10.21268/20161212-141647 ; https://nbn-resolving.org/urn:nbn:de:gbv:104-20161222-085708-6 ; https://dokumente.ub.tu-clausthal.de/receive/clausthal_mods_00000427 ; https://dokumente.ub.tu-clausthal.de/servlets/MCRFileNodeServlet/clausthal_derivate_00000206/Db%20112974.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kormann B. Automatische Testdatengenerierung zur Absicherung fehlerbehafteter reaktiver Automatisierungssysteme. [Thesis]. Technische Universität Dortmund; 2016. Available from: https://doi.org/10.21268/20161212-141647 ; https://nbn-resolving.org/urn:nbn:de:gbv:104-20161222-085708-6 ; https://dokumente.ub.tu-clausthal.de/receive/clausthal_mods_00000427 ; https://dokumente.ub.tu-clausthal.de/servlets/MCRFileNodeServlet/clausthal_derivate_00000206/Db%20112974.pdf

Not specified: Masters Thesis or Doctoral Dissertation

Université Catholique de Louvain

25.
Janssen, Micha.
A *Constraint* *Satisfaction* Approach for Enclosing Solutions to Initial Value Problems for Parametric Ordinary Differential Equations.

Degree: 2001, Université Catholique de Louvain

URL: http://hdl.handle.net/2078.1/5138

►

This work considers initial value problems (IVPs) for ordinary differential equations (ODEs) where some of the data is uncertain and given by intervals as is… (more)

Subjects/Keywords: Differential equation; Constraint satisfaction; Validated method

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Janssen, M. (2001). A Constraint Satisfaction Approach for Enclosing Solutions to Initial Value Problems for Parametric Ordinary Differential Equations. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/5138

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Janssen, Micha. “A Constraint Satisfaction Approach for Enclosing Solutions to Initial Value Problems for Parametric Ordinary Differential Equations.” 2001. Thesis, Université Catholique de Louvain. Accessed December 04, 2020. http://hdl.handle.net/2078.1/5138.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Janssen, Micha. “A Constraint Satisfaction Approach for Enclosing Solutions to Initial Value Problems for Parametric Ordinary Differential Equations.” 2001. Web. 04 Dec 2020.

Vancouver:

Janssen M. A Constraint Satisfaction Approach for Enclosing Solutions to Initial Value Problems for Parametric Ordinary Differential Equations. [Internet] [Thesis]. Université Catholique de Louvain; 2001. [cited 2020 Dec 04]. Available from: http://hdl.handle.net/2078.1/5138.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Janssen M. A Constraint Satisfaction Approach for Enclosing Solutions to Initial Value Problems for Parametric Ordinary Differential Equations. [Thesis]. Université Catholique de Louvain; 2001. Available from: http://hdl.handle.net/2078.1/5138

Not specified: Masters Thesis or Doctoral Dissertation

University of Oxford

26.
Salamon, András Z.
Transformations of representation in *constraint* * satisfaction*.

Degree: PhD, 2013, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:5d641fff-4d95-43b2-9ff8-73395d782ad8 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.627773

► In this thesis I study *constraint* *satisfaction* problems or CSPs. These require determining whether values can be assigned to variables so that all constraints are…
(more)

Subjects/Keywords: 006.3; Computer science (mathematics); Artificial Intelligence; Applications and algorithms; constraint satisfaction; hybrid tractability; microstructure

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Salamon, A. Z. (2013). Transformations of representation in constraint satisfaction. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:5d641fff-4d95-43b2-9ff8-73395d782ad8 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.627773

Chicago Manual of Style (16^{th} Edition):

Salamon, András Z. “Transformations of representation in constraint satisfaction.” 2013. Doctoral Dissertation, University of Oxford. Accessed December 04, 2020. http://ora.ox.ac.uk/objects/uuid:5d641fff-4d95-43b2-9ff8-73395d782ad8 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.627773.

MLA Handbook (7^{th} Edition):

Salamon, András Z. “Transformations of representation in constraint satisfaction.” 2013. Web. 04 Dec 2020.

Vancouver:

Salamon AZ. Transformations of representation in constraint satisfaction. [Internet] [Doctoral dissertation]. University of Oxford; 2013. [cited 2020 Dec 04]. Available from: http://ora.ox.ac.uk/objects/uuid:5d641fff-4d95-43b2-9ff8-73395d782ad8 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.627773.

Council of Science Editors:

Salamon AZ. Transformations of representation in constraint satisfaction. [Doctoral Dissertation]. University of Oxford; 2013. Available from: http://ora.ox.ac.uk/objects/uuid:5d641fff-4d95-43b2-9ff8-73395d782ad8 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.627773

Robert Gordon University

27.
Magaji, Amina Sambo-Muhammad.
Combining search strategies for distributed *constraint* * satisfaction*.

Degree: PhD, 2015, Robert Gordon University

URL: http://hdl.handle.net/10059/1374

► Many real-life problems such as distributed meeting scheduling, mobile frequency allocation and resource allocation can be solved using multi-agent paradigms. Distributed *constraint* *satisfaction* problems (DisCSPs)…
(more)

Subjects/Keywords: 005.1; Distributed constraint satisfaction; Distributed problem solving; Local search; Algorithms; Local optima; Heuristics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Magaji, A. S. (2015). Combining search strategies for distributed constraint satisfaction. (Doctoral Dissertation). Robert Gordon University. Retrieved from http://hdl.handle.net/10059/1374

Chicago Manual of Style (16^{th} Edition):

Magaji, Amina Sambo-Muhammad. “Combining search strategies for distributed constraint satisfaction.” 2015. Doctoral Dissertation, Robert Gordon University. Accessed December 04, 2020. http://hdl.handle.net/10059/1374.

MLA Handbook (7^{th} Edition):

Magaji, Amina Sambo-Muhammad. “Combining search strategies for distributed constraint satisfaction.” 2015. Web. 04 Dec 2020.

Vancouver:

Magaji AS. Combining search strategies for distributed constraint satisfaction. [Internet] [Doctoral dissertation]. Robert Gordon University; 2015. [cited 2020 Dec 04]. Available from: http://hdl.handle.net/10059/1374.

Council of Science Editors:

Magaji AS. Combining search strategies for distributed constraint satisfaction. [Doctoral Dissertation]. Robert Gordon University; 2015. Available from: http://hdl.handle.net/10059/1374

Linköping University

28. Olofsson, Emil. Improved algorithm for weighted matching of employees.

Degree: Database and information techniques, 2015, Linköping University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-122763

► This report gives the reader a detailed description of a computer engineering master thesis work done at the company Netlight Consulting AB. Netlight Consulting…
(more)

Subjects/Keywords: SONAR; Graph; Matching; Data mining; Linear programming; Linear regression; Constraint satisfaction; Computer Engineering; Datorteknik

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Olofsson, E. (2015). Improved algorithm for weighted matching of employees. (Thesis). Linköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-122763

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Olofsson, Emil. “Improved algorithm for weighted matching of employees.” 2015. Thesis, Linköping University. Accessed December 04, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-122763.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Olofsson, Emil. “Improved algorithm for weighted matching of employees.” 2015. Web. 04 Dec 2020.

Vancouver:

Olofsson E. Improved algorithm for weighted matching of employees. [Internet] [Thesis]. Linköping University; 2015. [cited 2020 Dec 04]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-122763.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Olofsson E. Improved algorithm for weighted matching of employees. [Thesis]. Linköping University; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-122763

Not specified: Masters Thesis or Doctoral Dissertation

Delft University of Technology

29.
Dohmen, M.H.P.J.
* Constraint*-based feature validation.

Degree: 1998, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:5ae85b5f-ce1a-4ae3-8e8c-1991b45b08eb ; urn:NBN:nl:ui:24-uuid:5ae85b5f-ce1a-4ae3-8e8c-1991b45b08eb ; urn:NBN:nl:ui:24-uuid:5ae85b5f-ce1a-4ae3-8e8c-1991b45b08eb ; http://resolver.tudelft.nl/uuid:5ae85b5f-ce1a-4ae3-8e8c-1991b45b08eb

► The feature modeling paradigm combines geometric and functional product information in one model. In an ideal product development environment, multiple views of a product in…
(more)

Subjects/Keywords: feature validation; constraint satisfaction; feature modeling

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dohmen, M. H. P. J. (1998). Constraint-based feature validation. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:5ae85b5f-ce1a-4ae3-8e8c-1991b45b08eb ; urn:NBN:nl:ui:24-uuid:5ae85b5f-ce1a-4ae3-8e8c-1991b45b08eb ; urn:NBN:nl:ui:24-uuid:5ae85b5f-ce1a-4ae3-8e8c-1991b45b08eb ; http://resolver.tudelft.nl/uuid:5ae85b5f-ce1a-4ae3-8e8c-1991b45b08eb

Chicago Manual of Style (16^{th} Edition):

Dohmen, M H P J. “Constraint-based feature validation.” 1998. Doctoral Dissertation, Delft University of Technology. Accessed December 04, 2020. http://resolver.tudelft.nl/uuid:5ae85b5f-ce1a-4ae3-8e8c-1991b45b08eb ; urn:NBN:nl:ui:24-uuid:5ae85b5f-ce1a-4ae3-8e8c-1991b45b08eb ; urn:NBN:nl:ui:24-uuid:5ae85b5f-ce1a-4ae3-8e8c-1991b45b08eb ; http://resolver.tudelft.nl/uuid:5ae85b5f-ce1a-4ae3-8e8c-1991b45b08eb.

MLA Handbook (7^{th} Edition):

Dohmen, M H P J. “Constraint-based feature validation.” 1998. Web. 04 Dec 2020.

Vancouver:

Dohmen MHPJ. Constraint-based feature validation. [Internet] [Doctoral dissertation]. Delft University of Technology; 1998. [cited 2020 Dec 04]. Available from: http://resolver.tudelft.nl/uuid:5ae85b5f-ce1a-4ae3-8e8c-1991b45b08eb ; urn:NBN:nl:ui:24-uuid:5ae85b5f-ce1a-4ae3-8e8c-1991b45b08eb ; urn:NBN:nl:ui:24-uuid:5ae85b5f-ce1a-4ae3-8e8c-1991b45b08eb ; http://resolver.tudelft.nl/uuid:5ae85b5f-ce1a-4ae3-8e8c-1991b45b08eb.

Council of Science Editors:

Dohmen MHPJ. Constraint-based feature validation. [Doctoral Dissertation]. Delft University of Technology; 1998. Available from: http://resolver.tudelft.nl/uuid:5ae85b5f-ce1a-4ae3-8e8c-1991b45b08eb ; urn:NBN:nl:ui:24-uuid:5ae85b5f-ce1a-4ae3-8e8c-1991b45b08eb ; urn:NBN:nl:ui:24-uuid:5ae85b5f-ce1a-4ae3-8e8c-1991b45b08eb ; http://resolver.tudelft.nl/uuid:5ae85b5f-ce1a-4ae3-8e8c-1991b45b08eb

30.
Hsu, Eric.
Integrating Probabilistic Reasoning with *Constraint* * Satisfaction*.

Degree: 2011, University of Toronto

URL: http://hdl.handle.net/1807/27584

►

We hypothesize and confirm that probabilistic reasoning is closely related to *constraint* *satisfaction* at a formal level, and that this relationship yields effective algorithms for…
(more)

Subjects/Keywords: Probabilistic Reasoning; Constraint Satisfaction; 0984

…Bibliography
259
ix
List of Tables
5.1
Primal/Dual concepts from *constraint* *satisfaction* and… …95
5.1
Optimization Representation of the *Constraint* *Satisfaction* Problem… …*constraint* *satisfaction* that abstracts away from many of the problem variations and algorithmic… …create a new class of heuristics for solving *constraint* *satisfaction* and *constraint*… …considers formal foundations within the probabilistic inference and *constraint* *satisfaction*…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hsu, E. (2011). Integrating Probabilistic Reasoning with Constraint Satisfaction. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/27584

Chicago Manual of Style (16^{th} Edition):

Hsu, Eric. “Integrating Probabilistic Reasoning with Constraint Satisfaction.” 2011. Doctoral Dissertation, University of Toronto. Accessed December 04, 2020. http://hdl.handle.net/1807/27584.

MLA Handbook (7^{th} Edition):

Hsu, Eric. “Integrating Probabilistic Reasoning with Constraint Satisfaction.” 2011. Web. 04 Dec 2020.

Vancouver:

Hsu E. Integrating Probabilistic Reasoning with Constraint Satisfaction. [Internet] [Doctoral dissertation]. University of Toronto; 2011. [cited 2020 Dec 04]. Available from: http://hdl.handle.net/1807/27584.

Council of Science Editors:

Hsu E. Integrating Probabilistic Reasoning with Constraint Satisfaction. [Doctoral Dissertation]. University of Toronto; 2011. Available from: http://hdl.handle.net/1807/27584