Accedi

Bibliografie tematiche / Constraint programming / Tesi

Segui questo link per vedere altri tipi di pubblicazioni sul tema: Constraint programming.

Tesi sul tema "Constraint programming"

Autore: Grafiati

Pubblicato: 4 giugno 2021

Ultima modifica: 25 luglio 2025

Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili

Scegli il tipo di fonte:

Vedi i top-50 saggi (tesi di laurea o di dottorato) per l'attività di ricerca sul tema "Constraint programming".

Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.

Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.

Vedi le tesi di molte aree scientifiche e compila una bibliografia corretta.

1

Duong, Khanh-Chuong. "Constrained clustering by constraint programming." Thesis, Orléans, 2014. http://www.theses.fr/2014ORLE2049/document.

Testo completo

Abstract (sommario):

La classification non supervisée, souvent appelée par le terme anglais de clustering, est une tâche importante en Fouille de Données. Depuis une dizaine d'années, la classification non supervisée a été étendue pour intégrer des contraintes utilisateur permettant de modéliser des connaissances préalables dans le processus de clustering. Différents types de contraintes utilisateur peuvent être considérés, des contraintes pouvant porter soit sur les clusters, soit sur les instances. Dans cette thèse, nous étudions le cadre de la Programmation par Contraintes (PPC) pour modéliser les tâches de clu

Gli stili APA, Harvard, Vancouver, ISO e altri

2

Achterberg, Tobias. "Constraint integer programming /." München : Verl. Dr. Hut, 2008. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=017108806&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

3

Achterberg, Tobias. "Constraint integer programming." München Verl. Dr. Hut, 2007. http://d-nb.info/992163366/04.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

4

Jefferson, Christopher. "Representations in constraint programming." Thesis, University of York, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.445465.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

5

McDonald, Iain. "Symmetry in constraint programming." Thesis, University of St Andrews, 2004. http://hdl.handle.net/10023/14983.

Testo completo

Abstract (sommario):

Constraint programming is an invaluable tool for solving many of the complex NP-complete problems that we need solutions to. These problems can be easily described as Constraint Satisfaction Problems (CSPs) and then passed to constraint solvers: complex pieces of software written to solve general CSPs efficiently. Many of the problems we need solutions to are real world problems: planning (e.g. vehicle routing), scheduling (e.g. job shop schedules) and timetabling problems (e.g. staff rotas) to name but a few. In the real world, we place structure on objects to make them easier to deal with. T

Gli stili APA, Harvard, Vancouver, ISO e altri

6

Backeman, Peter. "Propagating the nVector Constraint : Haplotype Inference using Constraint Programming." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-211862.

Testo completo

Abstract (sommario):

Genetics research is a wide field and needs computer aid in many different areas. One such problem is the haplotype inference problem by pure parsimony (HIPP). In this thesis the HIPP problem is attacked with a constraint programming (CP) model based on the nVector constraint, for which a new propagator is designed. The results show that the current state-of-the-art model based on SAT-solvers are in general the most efficient, but that the CP approach in some cases finds a better solution when time is limited.

Gli stili APA, Harvard, Vancouver, ISO e altri

7

Hnich, Brahim. "Function Variables for Constraint Programming." Doctoral thesis, Uppsala University, Department of Information Science, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-3143.

Testo completo

Abstract (sommario):

<p>Quite often modelers with constraint programming (CP) use the same modelling patterns for different problems, possibly from different domains. This results in recurring idioms in constraint programs. Our approach can be seen as a three-step approach. First, we identify some of these recurring patterns in constraint programs. Second, we propose a general way of describing these patterns by introducing proper constructs that would cover a wide range of applications. Third, we propose automating the process of reproducing these idioms from these higher-level descriptions. The whole process c

Gli stili APA, Harvard, Vancouver, ISO e altri

8

Jägare, Peter. "Airspace Sectorisation using Constraint Programming." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-155783.

Testo completo

Abstract (sommario):

Given a set of cells and a set of flight routes passing through these cells, we need to cluster cells into a given number of sectors, ensuring an even workload over all sectors, and fulfilling several other constraints on the wellformedness of sectors. The sectorisation is done by using constraint programming. Several propagators are designed to ensure the correctness of the sectorisation.

Gli stili APA, Harvard, Vancouver, ISO e altri

9

Olive, Xavier. "Symmetries in Distributed Constraint Programming." 京都大学 (Kyoto University), 2011. http://hdl.handle.net/2433/142134.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

10

Wetsel, Gerhard. "Abductive and constraint logic programming." Thesis, Imperial College London, 1997. http://hdl.handle.net/10044/1/7212.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

11

Edqvist, Samuel. "Scheduling Physicians using Constraint Programming." Thesis, Uppsala universitet, Avdelningen för datalogi, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-139606.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

12

Olarte, Carlos. "Universal Temporal Concurrent Constraint Programming." Phd thesis, Palaiseau, Ecole polytechnique, 2009. http://pastel.archives-ouvertes.fr/pastel-00005492/en/.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

13

Yang, Xiangxiu. "Examination scheduling by constraint programming." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/MQ65594.pdf.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

14

Petrie, Karen E. "Constraint programming, search and symmetry." Thesis, University of Huddersfield, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.430277.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

15

Garara, Ilyass. "Tourist Scheduler Using Constraint Programming." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-306959.

Testo completo

Abstract (sommario):

Planning a trip in present time still requires a significant amount of time and effort. With the absence of a single service that manages the planning aspect of a trip, tourists have to explore multiple sources of data, both online and offline, in order to prepare their schedules. Therefore, the following master thesis project introduces a system that generates a schedule for tourists who would like to visit the city of Stockholm. The system communicates with a mobile application to receive user-defined data such as mobility, budget and points of interest in order to find the best schedule by

Gli stili APA, Harvard, Vancouver, ISO e altri

16

Wang, Tianze. "Machine Learning for Constraint Programming." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254660.

Testo completo

Abstract (sommario):

It is well established that designing good heuristics for solving Constraint Programming models requires years of domain experience and a huge amount of trial and error. In this thesis project, we conduct an empirical study of whether Machine Learning and Deep Learning techniques have the potential to help the design of constraint solving heuristics.Specifically, this thesis project examines the potential of Machine Learning and Deep Learning models for the regression task of predicting the makespan and solving time of a Job-Shop Scheduling Problem without actually solving the given Job-Shop S

Gli stili APA, Harvard, Vancouver, ISO e altri

17

Amadini, Roberto <1984&gt. "Portfolio Approaches in Constraint Programming." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amsdottorato.unibo.it/6933/1/thesis.pdf.

Testo completo

Abstract (sommario):

Recent research has shown that the performance of a single, arbitrarily efficient algorithm can be significantly outperformed by using a portfolio of —possibly on-average slower— algorithms. Within the Constraint Programming (CP) context, a portfolio solver can be seen as a particular constraint solver that exploits the synergy between the constituent solvers of its portfolio for predicting which is (or which are) the best solver(s) to run for solving a new, unseen instance. In this thesis we examine the benefits of portfolio solvers in CP. Despite portfolio approaches have been extensively s

Gli stili APA, Harvard, Vancouver, ISO e altri

18

Amadini, Roberto <1984&gt. "Portfolio Approaches in Constraint Programming." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amsdottorato.unibo.it/6933/.

Testo completo

Abstract (sommario):

Recent research has shown that the performance of a single, arbitrarily efficient algorithm can be significantly outperformed by using a portfolio of —possibly on-average slower— algorithms. Within the Constraint Programming (CP) context, a portfolio solver can be seen as a particular constraint solver that exploits the synergy between the constituent solvers of its portfolio for predicting which is (or which are) the best solver(s) to run for solving a new, unseen instance. In this thesis we examine the benefits of portfolio solvers in CP. Despite portfolio approaches have been extensively s

Gli stili APA, Harvard, Vancouver, ISO e altri

19

Liu, Tong <1988&gt. "Innovative Applications of Constraint Programming." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amsdottorato.unibo.it/9068/1/main.pdf.

Testo completo

Abstract (sommario):

Constraint programming (CP) is a declarative paradigm that enables us to model a problem in the form of constraints to be satisfied. It offers powerful constraint solvers which, by implementing general-purpose search techniques, are fast and robust to address complex constraint models automatically. Constraint programming has attracted the attention of people from various domains. By separating the definition of a problem from its solution, it is more natural for people to implement the program directly from the problem specification, reducing the cost of development and future maintenance sig

Gli stili APA, Harvard, Vancouver, ISO e altri

20

Bistarelli, Stefano. "Semirings for soft constraint solving and programming /." Berlin [u.a.] : Springer, 2004. http://www.loc.gov/catdir/enhancements/fy0818/2004044967-d.html.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

21

Egri, László. "The complexity of constraint satisfaction problems and symmetric Datalog /." Thesis, McGill University, 2007. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=101843.

Testo completo

Abstract (sommario):

Constraint satisfaction problems (CSPs) provide a unified framework for studying a wide variety of computational problems naturally arising in combinatorics, artificial intelligence and database theory. To any finite domain D and any constraint language Γ (a finite set of relations over D), we associate the constraint satisfaction problem CSP(Γ): an instance of CSP(Γ) consists of a list of variables x1, x2,..., x n and a list of constraints of the form "(x 7, x2,..., x5) ∈ R" for some relation R in Γ. The goal is to determine whether the variables can be assigned values in D such that all cons

Gli stili APA, Harvard, Vancouver, ISO e altri

22

Nightingale, Peter. "Consistency and the quantified constraint satisfaction problem /." St Andrews, 2007. http://hdl.handle.net/10023/759.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

23

Anestos, Nikolaos-Ektoras. "Cloud Service Orchestration Using Constraint Programming." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-194507.

Testo completo

Abstract (sommario):

Cloud applications and services are frequently built using multiple tiers and current trends such as micro-services further increase componentization, allowing us to place each component in a different physical machine in a distributed cloud. Ericsson owns and manages very large networks, which offer diverse infrastructure in terms of computational power, storage but most importantly position in the network. Typically, a machine which is closer to the edge of the network (closer to the end user) will have limited resources but it will offer less latency, for a higher price. At the same time, s

Gli stili APA, Harvard, Vancouver, ISO e altri

24

Pellerin, Clément. "Taskell : a concurrent constraint programming language." Thesis, McGill University, 1991. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=61089.

Testo completo

Abstract (sommario):

Taskell is an instance of the concurrent constraint programming framework cc. The framework is parameterized by a choice of constraint system. The constraint system of Taskell is the set of finite trees with equality. The choice of constraint system makes Taskell similar to concurrent logic programming languages. When computing with partial information the notion of reading and writing memory becomes incoherent. The framework replaces these operations by ask and tell respectively. We hope to understand this new paradigm by studying implementations of cc languages. Taskell is a parallel impleme

Gli stili APA, Harvard, Vancouver, ISO e altri

25

Samual, John Francis. "Constraint programming in user interface construction." Thesis, Queen Mary, University of London, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.243303.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

26

Hassani, Bijarbooneh Farshid. "Constraint Programming for Wireless Sensor Networks." Doctoral thesis, Uppsala universitet, Avdelningen för datalogi, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-241378.

Testo completo

Abstract (sommario):

In recent years, wireless sensor networks (WSNs) have grown rapidly and have had a substantial impact in many applications. A WSN is a network that consists of interconnected autonomous nodes that monitor physical and environmental conditions, such as temperature, humidity, pollution, etc. If required, nodes in a WSN can perform actions to affect the environment. WSNs present an interesting and challenging field of research due to the distributed nature of the network and the limited resources of the nodes. It is necessary for a node in a WSN to be small to enable easy deployment in an environ

Gli stili APA, Harvard, Vancouver, ISO e altri

27

Smith, Alan William. "Scheduling a steelplant using constraint programming." Thesis, University of Leeds, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.250754.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

28

Calhau, João Pedro Figueira Galhardo. "Digital forensics research using constraint programming." Master's thesis, Universidade de Évora, 2018. http://hdl.handle.net/10174/24257.

Testo completo

Abstract (sommario):

In this dissertation we present a new and innovative approach to Digital Forensics analysis, based on Declarative Programming approaches, more specifically Constraint Programming methodologies, to describe and solve Digital Forensics problems. With this approach we allow for an intuitive, descriptive and more efficient method to analyze digital equipment data. The work described herein enables the description of a Digital Forensics Problem (DFP) as a Constraint Satisfaction Problem (CSP) and, with the help of a CSP solver, reach a solution to such problem, if it exists, which can be a set of e

Gli stili APA, Harvard, Vancouver, ISO e altri

29

Pedro, Vasco Fernando de Figueiredo Tavares. "Constraint programming on hierarchical multiprocessor systems." Doctoral thesis, Universidade de Évora, 2012. http://hdl.handle.net/10174/14184.

Testo completo

Abstract (sommario):

The work reported in this thesis is about constraint processing in the context of hierarchical multiprocessor systems, including distributed systems. More speci cally, it develops techniques and a system to help bringing the power available in today's multiprocessing networked systems into the constraint processing eld. Solving constraint speci ed problems is a process which lends itself naturally to parallelisation, as it usually implies going through very large search spaces, looking for a solution. Parallel constraint solving draws on the idea of dividing the search space among several wor

Gli stili APA, Harvard, Vancouver, ISO e altri

30

Rodosek, Robert. "Generation and comparison of constraint-based heuristics using structure of constraints." Thesis, Imperial College London, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.266590.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

31

Piesker, Björn. "Constraint-basierte Generierung realitätsnaher Eisenbahnnetze." Master's thesis, Universität Potsdam, 2007. http://opus.kobv.de/ubp/volltexte/2007/1532/.

Testo completo

Abstract (sommario):

Diese Arbeit befasst sich mit der Entwicklung einer Applikation, welche Infrastrukturdaten über Eisenbahnnetze generiert. Dabei bildet die Erzeugung der topologischen Informationen den Schwerpunkt dieser Arbeit. Der Anwender charakterisiert hierfür vorab das gewünschte Eisenbahnnetz, wobei die geforderten Eigenschaften die Randbedingungen darstellen, die bei der Synthese zu beachten sind. Zur Einhaltung dieser Bedingungen wird die Constraint-Programmierung eingesetzt, welche durch ihr spezielles Programmierparadigma konsistente Lösungen effizient erzeugt. Dies wird u.a. durch die Nachnutzung s

Gli stili APA, Harvard, Vancouver, ISO e altri

32

Heipcke, Susanne. "Combined modelling and problem solving in mathematical programming and constraint programming." Thesis, University of Buckingham, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.297665.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

33

Easton, Kelly King. "Using integer programming and constraint programming to solve sports scheduling problems." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/25795.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

34

Sellmann, Meinolf. "Reduction techniques in constraint programming and combinatorial optimization." [S.l. : s.n.], 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=96852656X.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

35

Bohlin, Markus. "Design and implementation of a graph-based constraint model for local search /." Västerås : Mälardalen University, 2004. http://www.mrtc.mdh.se/publications/0754.pdf.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

36

Schrijvers, Tom. "Overview of the monadic constraint programming framework." Universität Potsdam, 2010. http://opus.kobv.de/ubp/volltexte/2010/4141/.

Testo completo

Abstract (sommario):

A constraint programming system combines two essential components: a constraint solver and a search engine. The constraint solver reasons about satisfiability of conjunctions of constraints, and the search engine controls the search for solutions by iteratively exploring a disjunctive search tree defined by the constraint program. The Monadic Constraint Programming framework gives a monadic definition of constraint programming where the solver is defined as a monad threaded through the monadic search tree. Search and search strategies can then be defined as firstclass objects that can themselv

Gli stili APA, Harvard, Vancouver, ISO e altri

37

Lindqvist, Joakim. "Implementing a Physician Roster Using Constraint Programming." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-204896.

Testo completo

Abstract (sommario):

A successful rostering of physicians to different activities demands satisfying the minimal allocation of physicians to each activity, following regulations and hospital guidelines in regard to workload, and adhering to the preferences of the physicians. Keeping track of all of the constraints, ensuring that they are not violated, is a complicated task, which is still often done manually. This thesis uses constraint programming to propose a general model to the problem, with which a solution can be found by incrementally tighten the constraints through an iterative interaction with a user. An

Gli stili APA, Harvard, Vancouver, ISO e altri

38

Belaid, Mohamed-Bachir. "Declarative Itemset Mining Based on Constraint Programming." Thesis, Montpellier, 2020. http://www.theses.fr/2020MONTS004.

Testo completo

Abstract (sommario):

La fouille de données est l'art de découvrir des informations à partir de bases de données.L'utilisateur spécifie le type de motifs à extraire et le spécialiste utilise des techniques pour trouver les motifs requis.De nombreuses techniques ont été introduites pour l'extraction des motifs classiques tels que les motifs fréquents, les règles d'association, etc.Cependant, l'extraction des motifs avec des propriétés supplémentaires restent un problème pour les spécialistes car des efforts algorithmiques sont requises pour gérer ces propriétés.Récemment, les chercheurs ont profité de la flexibilité

Gli stili APA, Harvard, Vancouver, ISO e altri

39

Cortes, Antonio. "Enhancing test data generation using constraint programming." To access this resource online via ProQuest Dissertations and Theses @ UTEP, 2008. http://0-proquest.umi.com.lib.utep.edu/login?COPT=REJTPTU0YmImSU5UPTAmVkVSPTI=&clientId=2515.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

40

Almas, Luís Pedro Parreira Galito Pimenta. "DSM-PM2 adequacy for distributed constraint programming." Master's thesis, Universidade de Évora, 2007. http://hdl.handle.net/10174/16454.

Testo completo

Abstract (sommario):

As Redes de alta velocidade e o melhoramento rápido da performance dos microprocessadores fazem das redes de computadores um veículo apelativo para computação paralela. Não é preciso hardware especial para usar computadores paralelos e o sistema resultante é extensível e facilmente alterável. A programação por restrições é um paradigma de programação em que as relações entre as variáveis pode ser representada por restrições. As restrições diferem das primitivas comuns das outras linguagens de programação porque, ao contrário destas, não específica uma sequência de passos a executar mas antes a

Gli stili APA, Harvard, Vancouver, ISO e altri

41

CATTAFI, Massimiliano. "LOGIC AND CONSTRAINT PROGRAMMING FOR COMPUTATIONAL SUSTAINABILITY." Doctoral thesis, Università degli studi di Ferrara, 2012. http://hdl.handle.net/11392/2388775.

Testo completo

Abstract (sommario):

Computational Sustainability is an interdisciplinary field that aims to develop computational and mathematical models and methods for decision making concerning the management and allocation of resources in order to help solve environmental problems. This thesis deals with a broad spectrum of such problems (energy efficiency, water management, limiting greenhouse gas emissions and fuel consumption) giving a contribution towards their solution by means of Logic Programming (LP) and Constraint Programming (CP), declarative paradigms from Artificial Intelligence of proven solidity. The p

Gli stili APA, Harvard, Vancouver, ISO e altri

42

Thornton, John. "Constraint Weighting Local Search for Constraint Satisfaction." Thesis, Griffith University, 2000. http://hdl.handle.net/10072/367954.

Testo completo

Abstract (sommario):

One of the challenges for the constraint satisfaction community has been to develop an automated approach to solving Constraint Satisfaction Problems (CSPs) rather than creating specific algorithms for specific problems. Much of this work has concentrated on the development and improvement of general purpose backtracking techniques. However, the success of relatively simple local search techniques on larger satisfiability problems [Selman et a!. 1992] and CSPs such as the n-queens [Minton et al. 1992] has caused interest in applying local search to constraint satisfaction. In this thesis we lo

Gli stili APA, Harvard, Vancouver, ISO e altri

43

Kiziltan, Zeynep. "Symmetry Breaking Ordering Constraints." Doctoral thesis, Uppsala : Univ., Department of Information Science, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-3991.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

44

Karatas, Ahmet Serkan. "Analysis Of Extended Feature Models With Constraint Programming." Phd thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/3/12612082/index.pdf.

Testo completo

Abstract (sommario):

In this dissertation we lay the groundwork of automated analysis of extended feature models with constraint programming. Among different proposals, feature modeling has proven to be very effective for modeling and managing variability in Software Product Lines. However, industrial experiences showed that feature models often grow too large with hundreds of features and complex cross-tree relationships, which necessitates automated analysis support. To address this issue we present a mapping from extended feature models, which may include complex feature-feature, feature-attribute and attribute

Gli stili APA, Harvard, Vancouver, ISO e altri

45

Fahle, Torsten. "Integrating concepts from constraint programming and operations research algorithms." [S.l. : s.n.], 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=968544851.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

46

Policella, Nicola. "Scheduling with Uncertainty: A Proactive Approach using Partial Order Schedules." Doctoral thesis, La Sapienza, 2005. http://hdl.handle.net/11573/917059.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

47

Thornton, John Richard, and n/a. "Constraint Weighting Local Search for Constraint Satisfaction." Griffith University. School of Computing and Information Technology, 2000. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20050901.142439.

Testo completo

Abstract (sommario):

One of the challenges for the constraint satisfaction community has been to develop an automated approach to solving Constraint Satisfaction Problems (CSPs) rather than creating specific algorithms for specific problems. Much of this work has concentrated on the development and improvement of general purpose backtracking techniques. However, the success of relatively simple local search techniques on larger satisfiability problems [Selman et a!. 1992] and CSPs such as the n-queens [Minton et al. 1992] has caused interest in applying local search to constraint satisfaction. In this thesis we lo

Gli stili APA, Harvard, Vancouver, ISO e altri

48

Vigerske, Stefan. "Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2013. http://dx.doi.org/10.18452/16704.

Testo completo

Abstract (sommario):

Diese Arbeit leistet Beiträge zu zwei Gebieten der mathematischen Programmierung: stochastische Optimierung und gemischt-ganzzahlige nichtlineare Optimierung (MINLP). Im ersten Teil erweitern wir quantitative Stetigkeitsresultate für zweistufige stochastische gemischt-ganzzahlige lineare Programme auf Situationen in denen Unsicherheit gleichzeitig in den Kosten und der rechten Seite auftritt, geben eine ausführliche Übersicht zu Dekompositionsverfahren für zwei- und mehrstufige stochastische lineare und gemischt-ganzzahlig lineare Programme, und diskutieren Erweiterungen und Kombinationen d

Gli stili APA, Harvard, Vancouver, ISO e altri

49

Suy, Franch Josep. "A satisfiability modulo theories approach to constraint programming." Doctoral thesis, Universitat de Girona, 2012. http://hdl.handle.net/10803/98302.

Testo completo

Abstract (sommario):

In this thesis we focus on solving CSPs using SMT. Essentially, what we do is reformulating CSPs into SMT. The obtained results allow us to conclude that state-of-the-art SMT solvers are a robust tool to solve CSPs. We tackle not only decisional CSPs, but also Constraint Optimization Problems and Weighted Constraint Satisfaction Problems. For solving these problems we have used SMT in conjunction with appropriated algorithms: search algorithms and UNSAT core-based algorithms. We have provided support for meta-constraints that is, constraints on constraints. Meta-constraints can be very helpf

Gli stili APA, Harvard, Vancouver, ISO e altri

50

Pan, Xiaoyue. "Haplotype Inference by Pure Parsimony with Constraint Programming." Thesis, Uppsala University, Department of Information Technology, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-110544.

Testo completo

Abstract (sommario):

<p>Haplotype inference by pure parsimony problem (HIPP) is a computational problem in bioinformatics. It is a relatively new NP-hard problem and it has been thoroughly explored using integer programming, SAT-based programming and answer set programming. The state of the art approach is the SAT-based model. Constraint programming has been used as an optimisation tool in the SAT-based model but it has not been used as the modelling tool to solve the problem. This thesis models the HIPP problem using constraint programming. The constraint models are not as efficient as the SAT-based model but pro

Gli stili APA, Harvard, Vancouver, ISO e altri

Offriamo sconti su tutti i piani premium per gli autori le cui opere sono incluse in raccolte letterarie tematiche. Contattaci per ottenere un codice promozionale unico!