Relevant bibliographies by topics / Backtracking / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Backtracking.

Dissertations / Theses on the topic 'Backtracking'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Backtracking.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Muff, Urs C. "Backtracking model languages /." Access author, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Muñoz, Jugo Cynthia Mariela. "Algoritmos de backtracking o vuelta atrás." Universidad Peruana de Ciencias Aplicadas - UPC, 2007. http://hdl.handle.net/10757/272798.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Yu, Tein-Yow 1961. "Efficient backtracking strategies in test generation." Thesis, The University of Arizona, 1989. http://hdl.handle.net/10150/277191.

Full text
Abstract:
This thesis addresses the problem of backtracking strategies in test generation. First, a methodology which uses status of absolute dominators as a means for causing backtracking during the test generation process is presented. Then, different heuristics that force the test generation to execute the backtracking procedure are investigated. Experiments which generated test patterns for over 30,000 faults have been used to evaluate these heuristics. According to the experimental results, we recommend a new backtracking strategy that has the best performance among the six strategies explored in t
APA, Harvard, Vancouver, ISO, and other styles
4

King, Laurie Anne Smith. "Code generation using a backtracking LR parser." W&M ScholarWorks, 1992. https://scholarworks.wm.edu/etd/1539623820.

Full text
Abstract:
Although the parsing phase of the modern compiler has been automated in a machine independent fashion, the diversity of computer architectures inhibits automating the code generation phase. During code generation, some intermediate representation of a source program is transformed into actual machine instructions. The need for portable compilers has driven research towards the automatic generation of code generators.;This research investigates the use of a backtracking LR parser that treats code generation as a series of tree transformations.
APA, Harvard, Vancouver, ISO, and other styles
5

CODOGNET, CHRISTIAN. "Backtracking intelligent en programmation logique : un cadre général." Paris 7, 1989. http://www.theses.fr/1989PA077183.

Full text
Abstract:
Ce travail propose un cadre formel general pour l'etude de backtracking intelligent en programmation logique. On expose d'abord un algorithme d'unification etendue permettant de connaitre l'historique des liaisons en associant un graphe a un systeme d'equations. L'unifiabilite de celui-ci se caracterise par des proprietes simples de ce graphe. En particulier, on peut determiner les causes de non-unifiabilite. L'exploitation de cette information est a la base du schema de backtracking intelligent presente ensuite. Celui-ci procede de trois alternatives: ordre partiel ou total sur les nuds de l'
APA, Harvard, Vancouver, ISO, and other styles
6

Wong, Mark, and Samiul Alam. "Sudokulösare: Jämförelse av körtider för backtracking och mänskliga strategier." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166738.

Full text
Abstract:
Sudoku solvers are a widely researched topic among mathematicians and computer scientists. This report investigates the differences in execution time and time complexity between backtracking and human strategies for classes with 17-21 clues. Backtracking is compared to our implementation of human strategies with test data that contains 99 Sudoku puzzles for each class. The study shows that the execution time and time complexity is improved for human strategies compared to backtracking for each class. The conclusion shows that it is always favorable to implement the human strategies investigate
APA, Harvard, Vancouver, ISO, and other styles
7

Rathnayake, Asiri. "Semantics, analysis and security of backtracking regular expression matchers." Thesis, University of Birmingham, 2015. http://etheses.bham.ac.uk//id/eprint/6011/.

Full text
Abstract:
Regular expressions are ubiquitous in computer science. Originally defined by Kleene in 1956, they have become a staple of the computer science undergraduate curriculum. Practical applications of regular expressions are numerous, ranging from compiler construction through smart text editors to network intrusion detection systems. Despite having been vigorously studied and formalized in many ways, recent practical implementations of regular expressions have drawn criticism for their use of a non-standard backtracking algorithm. In this research, we investigate the reasons for this deviation and
APA, Harvard, Vancouver, ISO, and other styles
8

Ford, Bryan 1973. "Packet parsing : a practical linear-time algorithm with backtracking." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/87310.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ekström, Johan, та Kristofer Pitkäjärvi. "The backtracking algorithm and different representations for solving Sudoku Puzzles". Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-146016.

Full text
Abstract:
Two implementations of the backtracking algorithm for solving Sudoku puzzles as well as their dependence on the representations of the problem have been studied in order to ascertain pros and cons of different approaches. For each backtracking step, empty cells could be assigned numbers sequentially or, by using a greedy heuristic, by the probability that guessed numbers were more likely to be correct. Representations of the Sudoku puzzles varied from a n2 matrix to a n3 matrix, as well as a combination of both. This study shows that (1) a sequential approach has better best case times but poor
APA, Harvard, Vancouver, ISO, and other styles
10

Giese, Martin [Verfasser]. "Proof search without backtracking for free variable tableaux / Martin Giese." Karlsruhe : KIT-Bibliothek, 2002. http://d-nb.info/101382816X/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Drake, Lyndon Paul. "Combining inference and backtracking search for the propositional satisfiability problem." Thesis, University of York, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.421496.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Vargo, Cortney G. "An evaluation of computer-supported backtracking in a hierarchical database." Thesis, Virginia Tech, 1992. http://hdl.handle.net/10919/41512.

Full text
Abstract:
A common concern for people using computer databases is becoming "lost" within the complex hierarchy of entries. Most direct manipulation interface design guidelines suggest designers should include a feature for “undoing” user inputs (Smith and Mosier, 1986). In the case of a database, undo translates to backtracking support. The first purpose of this research was to confirm that computer-supported backtracking tools reduce navigation time over manual backtracking. The second purpose was to compare navigation times among a subset of backtracking tools. The third purpose was to determine if us
APA, Harvard, Vancouver, ISO, and other styles
13

Abdelkareem, Moamen. "Structural basis of transcription : RNA polymerase backtracking and its reactivation." Thesis, Strasbourg, 2019. http://www.theses.fr/2019STRAJ062.

Full text
Abstract:
Ma thèse se focalise sur la compréhension d’un phénomène de transcription, appelé backtracking, qui inactive la RNAP et arrête la transcription. La réactivation des complexes RNAP arrêtés et la reprise de la transcription nécessitent un facteur protéique appelé GreB. L’objectif du projet était d’obtenir des informations structurelles sur: i) la façon dont le retour en arrière inactive la RNAP dans E. coli; et ii) comment GreB sauve la RNAP en marche arrière pour continuer la transcription. À l'aide de SP cryo-EM, j’ai capturé quatre instantanés de RNAP dans différents états. Mes résultats mont
APA, Harvard, Vancouver, ISO, and other styles
14

Kim, Byungyu. "Solar Energy Generation Forecasting and Power Output Optimization of Utility Scale Solar Field." DigitalCommons@CalPoly, 2020. https://digitalcommons.calpoly.edu/theses/2149.

Full text
Abstract:
The optimization of photovoltaic (PV) power generation system requires an accurate system performance model capable of validating the PV system optimization design. Currently, many commercial PV system modeling programs are available, but those programs are not able to model PV systems on a distorted ground level. Furthermore, they were not designed to optimize PV systems that are already installed. To solve these types of problems, this thesis proposes an optimization method using model simulations and a MATLAB-based PV system performance model. The optimization method is particularly designe
APA, Harvard, Vancouver, ISO, and other styles
15

Drakos, Nikos. "Sequential and parallel execution of logic programs with dependency directed backtracking." Thesis, University of Leeds, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.277238.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Glover, Cory. "The Non-Backtracking Spectrum of a Graph and Non-Bactracking PageRank." BYU ScholarsArchive, 2021. https://scholarsarchive.byu.edu/etd/9194.

Full text
Abstract:
This thesis studies two problems centered around non-backtracking walks on graphs. First, we analyze the spectrum of the non-backtracking matrix of a graph. We show how to obtain the eigenvectors of the non-backtracking matrix using a smaller matrix and in doing so, create a block diagonal decomposition which more clearly expresses the non-backtracking matrix eigenvalues. Additionally, we develop upper and lower bounds on the matrix spectrum and use the spectrum to investigate properties of the graph. Second, we investigate the difference between PageRank and non-backtracking PageRank. We show
APA, Harvard, Vancouver, ISO, and other styles
17

Sävhammar, Simon. "Tillämpbarheten av Learning Backtracking Search Optimization Algoritmen vid Lösning av Sudoku-problemet." Thesis, Högskolan i Skövde, Institutionen för informationsteknologi, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-14087.

Full text
Abstract:
Den här rapporten undersöker egenskaper hos en algoritm som är baserad på Learning Backtracking Search Optimization Algorithm (LBSA) som introducerades av Chen et. al. (2017). Undersökningen genomfördes genom att tillämpa algoritmen på Sudokuproblemet och jämföra lösningsgraden och diversiteten i den sista populationen med en algoritm som är baserad på Hybrid Genetic Algorithm (HGA) som introducerades av Deng och Li (2011). Resultaten visar att implementationen av den LBSA-baserade algoritmen har en lägre lösningsgrad än den HGA-baserade algoritmen för alla genomförda experiment, men att algor
APA, Harvard, Vancouver, ISO, and other styles
18

Zatreanu, Diana Alexandra. "Characterisation of RNA polymerase II backtracking and its consequences in human cells." Thesis, University College London (University of London), 2018. http://discovery.ucl.ac.uk/10051035/.

Full text
Abstract:
Transcription elongation by RNA polymerase II (RNAPII) is a highly complex process in which RNAPII moves by Brownian motion. Therefore, transcript elongation is a surprisingly interrupted process, including frequent pausing, backtracking and arrest (collectively referred to as transcription stress). A backtracked RNAPII is specifically recognized by transcription factor TFIIS, which can stimulate the intrinsic RNA endonuclease activity of RNAPII to cleave the transcript so that the polymerase active site regains control of the RNA end. Previous work performed by our group in S. cerevisiae show
APA, Harvard, Vancouver, ISO, and other styles
19

Reinsch, Michael. "Entwicklung und Evaluation eines Algorithmus zur initialen Konfiguration von Anwendungen in PCOM." [S.l. : s.n.], 2004. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB11482147.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Sillito, Jonathan. "Improvements to and estimating the cost of backtracking algorithms for constraint satisfaction problems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0008/MQ59878.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Effinger, Robert T. "Optimal temporal planning at reactive time scales via dynamic backtracking branch and bound." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/37948.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2006.<br>Includes bibliographical references (p. 110-115).<br>Autonomous robots are being considered for increasingly capable roles in our society, such as urban search and rescue, automation for assisted living, and lunar habitat construction. To fulfill these roles, teams of autonomous robots will need to cooperate together to accomplish complex mission objectives in uncertain and dynamic environments. In these environments, autonomous robots face a host of new challenges, such as responding robustly
APA, Harvard, Vancouver, ISO, and other styles
22

Codognet, Philippe. "Backtracking intelligent en programmation logique : de la théorie à l'implémentation et à l'application au parallélisme." Bordeaux 1, 1989. http://www.theses.fr/1989BOR10504.

Full text
Abstract:
Proposition d'un cadre formel permettant une etude detaillee du probleme, puis d'une simplification de celui-ci en vue d'une implementation. Sa mise en uvre est ensuite exposee, suivie d'une evaluation de ses performances aussi bien vis-a-vis de prolog que des autres methodes de backfracking intelligent. Apres un etat de l'art des differentes recherches en programmation logique parallele, il est propose d'integrer du backfracking intelligent aux deux techniques de parallelisation les plus prometteuses
APA, Harvard, Vancouver, ISO, and other styles
23

Smith, Logan J. "Power Output Modeling and Optimization for a Single Axis Tracking Solar Farm on Skewed Topography Causing Extensive Shading." DigitalCommons@CalPoly, 2021. https://digitalcommons.calpoly.edu/theses/2293.

Full text
Abstract:
Many utility-scale solar farms use horizontal single axis tracking to follow the sun throughout the day and produce more energy. Solar farms on skewed topography produce complex shading patterns that require precise modeling techniques to determine the energy output. To accomplish this, MATLAB was used in conjunction with NREL weather predictions to predict shading shapes and energy outputs. The MATLAB models effectively predicted the sun’s position in the sky, panel tilt angle throughout the day, irradiance, cell temperature, and shading size. The Cal Poly Gold Tree Solar Farm was used to val
APA, Harvard, Vancouver, ISO, and other styles
24

Kouril, Michal. "A Backtracking Framework for Beowulf Clusters with an Extension to Multi-cluster Computation and SAT Benchmark Problem Implementation." University of Cincinnati / OhioLINK, 2006. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1163607141.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Tchvagha, Zeine Ahmed. "Contribution à l’optimisation multi-objectifs sous contraintes : applications à la mécanique des structures." Thesis, Normandie, 2018. http://www.theses.fr/2018NORMIR13/document.

Full text
Abstract:
L’objectif de cette thèse est le développement de méthodes d’optimisation multi-objectif pour la résolution de problèmes de conception des structures mécaniques. En effet, la plupart des problèmes réels dans le domaine de la mécanique des structures ont plusieurs objectifs qui sont souvent antagonistes. Il s’agit, par exemple, de concevoir des structures en optimisant leurs poids, leurs tailles, et leurs coûts de production. Le but des méthodes d’optimisation multi-objectif est la recherche des solutions de compromis entre les objectifs étant donné l’impossibilité de satisfaire tout simultaném
APA, Harvard, Vancouver, ISO, and other styles
26

Picek, Radomír. "Scrabble." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2008. http://www.nusl.cz/ntk/nusl-235990.

Full text
Abstract:
This thesis describes the social table game Scrabble, and its realization in the form of computer games. Gradually examines all important aspects that affect the performance of the implementation. Especially after the election of the appropriate data structures retained for the vocabulary, affecting the efficiency of generating moves, and the selection of appropriate algorithms with regard to the maximum speed. There is particular emphasis on artificial intelligence opponent and its ability to compete not only amateurs, but professional SCRABBLE players.
APA, Harvard, Vancouver, ISO, and other styles
27

Thomas-Thielsch, Katrin [Verfasser], Thomas [Akademischer Betreuer] Ptak-Fix, Martin [Akademischer Betreuer] Sauter, and Maria [Akademischer Betreuer] Herold. "Backtracking approaches for the delineation of contamination sources / Katrin Thomas-Thielsch. Gutachter: Martin Sauter ; Maria Herold. Betreuer: Thomas Ptak-Fix." Göttingen : Niedersächsische Staats- und Universitätsbibliothek Göttingen, 2013. http://d-nb.info/1045776106/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Langenau, Holger. "Squaring the square." Universitätsbibliothek Chemnitz, 2018. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-233031.

Full text
Abstract:
Given a square with integer side length n, we ask for the number of different ways to divide it into sub-squares, considering only the list of parts. We enumerate all possible lists and check whether a placement with those squares is possible. In order to do this, we propose a new algorithm for creating perfect square packings.
APA, Harvard, Vancouver, ISO, and other styles
29

SOLA, THIERRY. "Modeles d'execution de la programmation logique bases sur le graphe de dependance des liaisons : backtracking intelligent, maintien des deductions et contraintes." Paris 11, 1995. http://www.theses.fr/1995PA112429.

Full text
Abstract:
Ce travail est centre sur l'etude d'un graphe general de dependance des liaisons qui est une structure fondamentale du principe de resolution permettant de concevoir toute une variete de nouveaux modeles d'execution pour la programmation logique et la programmation logique avec contraintes (plc). Le premier modele propose nous a permis d'integrer une methode de backtracking intelligent dans un compilateur prolog. Pour cela, une extension de la machine abstraite de warren (wam) a ete definie: la wamib. Un modele d'execution est ensuite presente integrant en plus une methode de maintien des dedu
APA, Harvard, Vancouver, ISO, and other styles
30

Majid, Safwat. "Åtgärder för ökad markanvändning i solcellspark : En tekno-ekonomisk fallstudie om potentialen hos bifacial och solföljare i Solpark Fyrislund." Thesis, Uppsala universitet, Solcellsteknik, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-447110.

Full text
Abstract:
Solar parks are increasingly getting a larger market share of PV installations over the world, and have for the last couple of years managed to establish itself in the Swedish market. The market has for a long time been known for its decline in module prices, which has allowed an emergence of more efficient PV-techniques such as one-axis trackers and bifacial modules. Bifacial modules use the backside of modules for improved utiliziation of incoming light, while one-axis trackers have the ability to track the sun in order to maximise light absorption. These innovations have now caught the inte
APA, Harvard, Vancouver, ISO, and other styles
31

Heijltjes, Willem Bernard. "Graphical representation of canonical proof : two case studies." Thesis, University of Edinburgh, 2012. http://hdl.handle.net/1842/5838.

Full text
Abstract:
An interesting problem in proof theory is to find representations of proof that do not distinguish between proofs that are ‘morally’ the same. For many logics, the presentation of proofs in a traditional formalism, such as Gentzen’s sequent calculus, introduces artificial syntactic structure called ‘bureaucracy’; e.g., an arbitrary ordering of freely permutable inferences. A proof system that is free of bureaucracy is called canonical for a logic. In this dissertation two canonical proof systems are presented, for two logics: a notion of proof nets for additive linear logic with units, and ‘cl
APA, Harvard, Vancouver, ISO, and other styles
32

Backer, Bruno de. "Méthodes de résolution de disjonctions de contraintes linéaires : application à la programmation logique avec contraintes." Orléans, 1995. http://www.theses.fr/1995ORLE2009.

Full text
Abstract:
De nombreux problèmes en intelligence artificielle et en recherche opérationnelle peuvent s'exprimer comme la recherche d'une solution (éventuellement optimale) sur un ensemble de disjonctions de contraintes linéaires. Ces problèmes sont difficiles à résoudre, car la présence de disjonctions induit une forte combinatoire. Les algorithmes décrits dans cet ouvrage peuvent être séparés en deux catégories. La première comprend des extensions de la programmation disjonctive et des algorithmes de propagation de bornes. Ces algorithmes de regard en avant sont utilisés pour réduire a priori la combina
APA, Harvard, Vancouver, ISO, and other styles
33

BHUJEL, MAN BAHADUR. "Performance Enhancement of Data Retrieval from Episodic Memory in Soar Architecture." University of Toledo / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1524837171020967.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Boussier, Sylvain. "Etude de Resolution Search pour la programmation linéaire en variables binaires." Phd thesis, Université Montpellier II - Sciences et Techniques du Languedoc, 2008. http://tel.archives-ouvertes.fr/tel-00381912.

Full text
Abstract:
Dans cette thèse, nous nous intéressons à la résolution exacte de programmes linéaires en variables binaires. L'ensemble de nos travaux s'articule autour de l'étude de Resolution search (Chvátal (1997)) pour la résolution du problème du sac à dos multidimensionnel en 0-1. Dans un premier temps, nous proposons un algorithme d'énumération implicite centré sur une analyse des coûts réduits à l'optimum de la relaxation continue ainsi que sur une décomposition de l'espace de recherche en hyperplans. Nous proposons une stratégie de branchement originale visant à élaguer au plus tôt l'arbre de recher
APA, Harvard, Vancouver, ISO, and other styles
35

Viana, Mateus Mosca. "AplicaÃÃo da anÃlise matemÃtica no rastreamento reverso do nÃmero IP para o uso em redes TCP/IP sob ataque de negaÃÃo-de-serviÃo." Universidade Federal do CearÃ, 2007. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=2138.

Full text
Abstract:
O ataque por negaÃÃo de serviÃo ficou conhecido a partir do ano de 1988, tendo se tornado uma grave ameaÃa ao funcionamento das redes de computadores em todo o mundo. Quando essa modalidade de ataque està em curso a vÃtima recebe um incremento tÃo intenso na demanda pelos seus recursos computacionais, que os mesmos podem se tornar indisponÃveis aos usuÃrios. A despeito de existirem outras formas de ataques a redes de computadores, a negaÃÃo-de-serviÃo tem sido alvo de particular interesse da comunidade cientÃfica dedicada no estudo da seguranÃa de redes de computadores. Isto se deve à simplici
APA, Harvard, Vancouver, ISO, and other styles
36

Ung, Hervé. "Quasi real-time model for security of water distribution network." Thesis, Bordeaux, 2016. http://www.theses.fr/2016BORD0015/document.

Full text
Abstract:
Le but de cette thèse est de modéliser la propagation d’un contaminant au sein d’un réseau d’eau potable muni de capteurs temps réel. Elle comporte les trois axes de développement suivant: la résolution des équations de transport, celle du problème d’identification des sources de contamination et le placement des capteurs.Le transport d’un produit chimique est modélisé dans un réseau d’eau potable par l’équation de transport réaction 1-D avec l’hypothèse de mélange parfait aux noeuds. Il est proposé d’améliorer sa prédiction par l’ajout d’un modèle de mélange imparfait aux jonctions double T e
APA, Harvard, Vancouver, ISO, and other styles
37

Lucas, François. "Des métaheuristiques pour le guidage d’un solveur de contraintes dédié à la planification automatisée de véhicules." Thesis, Paris, ENMP, 2012. http://www.theses.fr/2012ENMP0027/document.

Full text
Abstract:
Cette thèse, réalisée en collaboration avec Sagem Défense Sécurité, porte sur l'élaboration d'une stratégie de recherche efficace pour la résolution de problèmes de planification d'itinéraires de véhicules. Nous considérons ici en particulier les problèmes de planification avec contraintes de points de passage et de "capacité" (énergie, bande passante radio) appliquées au véhicule. Ce document propose une approche originale, hybridant un algorithme de colonies de fourmis avec un solveur de Programmation par Contraintes existant. Le premier est utilisé pour résoudre rapidement une version relax
APA, Harvard, Vancouver, ISO, and other styles
38

Demassey, Sophie. "Méthodes hybrides de programmation par contraintes et programmation linéaire pour le problème d'ordonnancement de projet à contrainte de ressources." Phd thesis, Université d'Avignon, 2003. http://tel.archives-ouvertes.fr/tel-00293564.

Full text
Abstract:
La version classique du problème d'ordonnancement de projet à contraintes de ressources (RCPSP) consiste à trouver un ordonnancement, de durée minimale, des activités d'un projet entrant en compétition sur l'usage de ressources renouvelables, cumulatives et disponibles en quantité limité. <br />La réputation d'extrême difficulté du RCPSP a mené nombre de chercheurs à proposer de nouvelles méthodes de résolution exacte toujours plus performantes pour ce problème. Malgré cela, les instances de tailles réelles, qui se recontrent fréquemment, par exemple dans la gestion de production industrielle,
APA, Harvard, Vancouver, ISO, and other styles
39

Boussier, Sylvain. "Etude de Resolution Search pour la Programmation Linéaire en Variables Binaires." Phd thesis, Montpellier 2, 2008. http://www.theses.fr/2008MON20156.

Full text
Abstract:
Dans cette thèse, nous nous intéressons à la résolution exacte de programmes linéaires en variables binaires. L'ensemble de nos travaux s'articule autour de l'étude de Resolution search (Chvatal (1997)) pour la résolution du problème du sac à dos multidimensionnel en 0-1. Dans un premier temps, nous proposons un algorithme d'énumération implicite centré sur une analyse des coûts réduits à l'optimum de la relaxation continue ainsi que sur une décomposition de l'espace de recherche en hyperplans. Nous proposons une stratégie de branchement originale visant à élaguer au plus tôt l'arbre de recher
APA, Harvard, Vancouver, ISO, and other styles
40

Park, Vincent Se-jin. "AN EMPIRICAL STUDY OF DIFFERENT BRANCHING STRATEGIES FOR CONSTRAINT SATISFACTION PROBLEMS." Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/1193.

Full text
Abstract:
Many real life problems can be formulated as constraint satisfaction problems <i>(CSPs)</i>. Backtracking search algorithms are usually employed to solve <i>CSPs</i> and in backtracking search the choice of branching strategies can be critical since they specify how a search algorithm can instantiate a variable and how a problem can be reduced into subproblems; that is, they define a search tree. In spite of the apparent importance of the branching strategy, there have been only a few empirical studies about different branching strategies and they all have been tested exclusively for nume
APA, Harvard, Vancouver, ISO, and other styles
41

Rossato, Luciara Vellar. "Otimização de amortecedores de massa sintonizados em estruturas submetidas a um processo estacionário." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2017. http://hdl.handle.net/10183/163246.

Full text
Abstract:
Atualmente as estruturas estão sendo avaliadas para um maior número de ações em relação há algumas décadas. Esta melhoria ao longo da fase de concepção é dada devido ao fato de que está se tornando mais competitivo o fornecimento de estruturas leves e esbeltas, sendo solicitados, cada vez mais, projetos com menor custo de implantação. Devido a isto, é necessário avaliar as estruturas não apenas sujeitas a cargas estáticas, mas também a carregamentos dinâmicos. As ações dinâmicas que atuam sobre uma estrutura podem ser muito mais prejudiciais do que as estáticas quando não são bem consideradas
APA, Harvard, Vancouver, ISO, and other styles
42

Dary, Franck. "Modèles incrémentaux pour le traitement automatique des langues." Electronic Thesis or Diss., Aix-Marseille, 2022. http://www.theses.fr/2022AIXM0248.

Full text
Abstract:
Cette thèse s'inscrit dans le domaine du traitement automatique de la langue, elle concerne plus particulièrement la prédiction de la structure syntaxico morphologique des phrases.Il s'agit donc, à partir d'un texte, de découper ce dernier en phrases puis en mots et d'associer aux mots une partie de discours et des traits morphologiques puis de relier les mots pour expliciter la structure syntaxique.La thèse propose un modèle de prédiction qui permet de réaliser ces tâches simultanément et de manière incrémentale : le texte est lu caractère par caractère et l'intégralité des prédictions lingui
APA, Harvard, Vancouver, ISO, and other styles
43

Sá, Alan Oliveira de. "Localização colaborativa em robótica de enxame." Universidade do Estado do Rio de Janeiro, 2015. http://www.bdtd.uerj.br/tde_busca/arquivo.php?codArquivo=8895.

Full text
Abstract:
Fundação de Amparo à Pesquisa do Estado do Rio de Janeiro<br>Diversas das possíveis aplicações da robótica de enxame demandam que cada robô seja capaz de estimar a sua posição. A informação de localização dos robôs é necessária, por exemplo, para que cada elemento do enxame possa se posicionar dentro de uma formatura de robôs pré-definida. Da mesma forma, quando os robôs atuam como sensores móveis, a informação de posição é necessária para que seja possível identificar o local dos eventos medidos. Em virtude do tamanho, custo e energia dos dispositivos, bem como limitações impostas pelo ambien
APA, Harvard, Vancouver, ISO, and other styles
44

Gulikers, Lennart. "Sur deux problèmes d’apprentissage automatique : la détection de communautés et l’appariement adaptatif." Thesis, Paris Sciences et Lettres (ComUE), 2017. http://www.theses.fr/2017PSLEE062/document.

Full text
Abstract:
Dans cette thèse, nous étudions deux problèmes d'apprentissage automatique : (I) la détection des communautés et (II) l'appariement adaptatif. I) Il est bien connu que beaucoup de réseaux ont une structure en communautés. La détection de ces communautés nous aide à comprendre et exploiter des réseaux de tout genre. Cette thèse considère principalement la détection des communautés par des méthodes spectrales utilisant des vecteurs propres associés à des matrices choisiesavec soin. Nous faisons une analyse de leur performance sur des graphes artificiels. Au lieu du modèle classique connu sous le
APA, Harvard, Vancouver, ISO, and other styles
45

Kopřiva, Jan. "Srovnání algoritmů při řešení problému obchodního cestujícího." Master's thesis, Vysoké učení technické v Brně. Fakulta podnikatelská, 2009. http://www.nusl.cz/ntk/nusl-222126.

Full text
Abstract:
The Master Thesis deals with logistic module innovation of information system ERP. The principle of innovation is based on implementation of heuristic algorithms which solve Travel Salesman Problems (TSP). The software MATLAB is used for analysis and tests of these algorithms. The goal of Master Thesis is the comparison of selections algorithm, which are suitable for economic purposes (accuracy of solution, speed of calculation and memory demands).
APA, Harvard, Vancouver, ISO, and other styles
46

Saade, Alaa. "Spectral inference methods on sparse graphs : theory and applications." Thesis, Paris Sciences et Lettres (ComUE), 2016. http://www.theses.fr/2016PSLEE024/document.

Full text
Abstract:
Face au déluge actuel de données principalement non structurées, les graphes ont démontré, dans une variété de domaines scientifiques, leur importance croissante comme language abstrait pour décrire des interactions complexes entre des objets complexes. L’un des principaux défis posés par l’étude de ces réseaux est l’inférence de propriétés macroscopiques à grande échelle, affectant un grand nombre d’objets ou d’agents, sur la seule base des interactions microscopiquesqu’entretiennent leurs constituants élémentaires. La physique statistique, créée précisément dans le but d’obtenir les lois mac
APA, Harvard, Vancouver, ISO, and other styles
47

Blažek, Martin. "Interaktivní interpret jazyka C." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2008. http://www.nusl.cz/ntk/nusl-235978.

Full text
Abstract:
This master's thesis deals with implementation of ISO C99 language interpreter. The goal of this thesis is to provide support of education in C language programming and fast algorithm prototyping. It enables students to create own C programs and to experiment with language constructions without compiling. User interface includes editor and simple debugger. The interpreter is implemented in a novel grammar development environment written in Java language - ANTLRWorks which includes ANTLR language tool.
APA, Harvard, Vancouver, ISO, and other styles
48

Nosek, Ondřej. "Hardwarová akcelerace algoritmu pro hledání podobnosti dvou DNA řetězců." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2007. http://www.nusl.cz/ntk/nusl-236882.

Full text
Abstract:
Methods for aproximate string matching of various sequences used in bioinformatics are crucial part of development in this branch. Tasks are of very large time complexity and therefore we want create a hardware platform for acceleration of these computations. Goal of this work is to design a generalized architecture based on FPGA technology, which can work with various types of sequences. Designed acceleration card will use especially dynamic algorithms like Needleman-Wunsch and Smith-Waterman.
APA, Harvard, Vancouver, ISO, and other styles
49

Cheng, Shun-Jen, and 鄭舜仁. "Backtracking Subjunctive Conditionals." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/44124131291891566603.

Full text
Abstract:
碩士<br>國立中正大學<br>哲學研究所<br>101<br>Backtracking subjunctive conditionals are those of which subjunctive conditionals to be evaluated base on backtracking to preconditions of how things would be caused. David Lewis (1979) and Keith DeRose (2010) both think that backtracking has unwelcome consequence. David Lewis points out that backtracking is non-standard and unstable. Keith DeRose thinks that backtracking is unavailable for future directed subjunctive conditionals. In this thesis, the objective is to propose backtracking subjunctive conditionals for some applications especially in software engin
APA, Harvard, Vancouver, ISO, and other styles
50

Huang, Xin-Ci, and 黃訢慈. "Teacher's Image Backtracking Journey." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/99018292003187452898.

Full text
Abstract:
碩士<br>國立臺東大學<br>教育學系(所)<br>102<br>This study aims to explore the researcher’s teacher’s image. Self-narrative was used in a chronological order to represent the researcher’s complete life journey before and during the teaching post. Through exploration of the teacher’s image, the researcher first collected life stories about teacher-student interaction during the teaching post. Through the reflection of the contents, the researcher found her personality traits, professional performance, and her own teacher’s beliefs. Moreover, Texts before the teaching post were examined to probe the f
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Backtracking' for other source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography