Log in

Relevant bibliographies by topics / Grid graphs / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Grid graphs.

Dissertations / Theses on the topic 'Grid graphs'

Author: Grafiati

Published: 4 June 2021

Last updated: 26 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 'Grid graphs.'

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

Wojciechowska, Iwona. "Broadcasting in grid graphs." Morgantown, W. Va. : [West Virginia University Libraries], 1999. http://etd.wvu.edu/templates/showETD.cfm?recnum=877.

Full text

Abstract:

Thesis (Ph. D.)--West Virginia University, 1999.<br>Title from document title page. Document formatted into pages; contains vii, 69 p. : ill. Includes abstract. Includes bibliographical references (p. 67-69).

APA, Harvard, Vancouver, ISO, and other styles

2

Rocha, Mário. "The embedding of complete bipartite graphs onto grids with a minimum grid cutwidth." CSUSB ScholarWorks, 2003. https://scholarworks.lib.csusb.edu/etd-project/2311.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Proffitt, Kenneth Eugene. "Paired-domination in grid graphs." [Johnson City, Tenn. : East Tennessee State University], 2001. http://etd-submit.etsu.edu/etd/theses/available/etd-0213101-214504/restricted/proffittk.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Sterling, Christopher Kent. "Liar's Domination in Grid Graphs." Digital Commons @ East Tennessee State University, 2012. https://dc.etsu.edu/etd/1415.

Full text

Abstract:

As introduced by Slater in 2008, liar's domination provides a way of modeling protection devices where one may be faulty. Assume each vertex of a graph G is the possible location for an intruder such as a thief. A protection device at a vertex v is assumed to be able to detect the intruder at any vertex in its closed neighborhood N[v] and identify at which vertex in N[v] the intruder is located. A dominating set is required to identify any intruder's location in the graph G, and if any one device can fail to detect the intruder, then a double-dominating set is necessary. Stronger still, a liar

APA, Harvard, Vancouver, ISO, and other styles

5

Wang, Jiaxin. "Various pushing methods on grid graphs." Morgantown, W. Va. : [West Virginia University Libraries], 1999. http://etd.wvu.edu/templates/showETD.cfm?recnum=839.

Full text

Abstract:

Thesis (M.S.)--West Virginia University, 1999.<br>Title from document title page. Document formatted into pages; contains v, 39 p. : ill. (some col.) Includes abstract. Includes bibliographical references (p. 39).

APA, Harvard, Vancouver, ISO, and other styles

6

Curro', Vincenzo. "The Roman Domination Problem on Grid Graphs." Doctoral thesis, Università di Catania, 2014. http://hdl.handle.net/10761/1561.

Full text

Abstract:

Domination is a rapidly developing area of research in graph theory. This dissertation focuses on the Roman Domination Problem; it was introduced quite recently and has some interesting applications in real world problems such military strategies and wireless networking. Given a graph, a Roman Dominating Function is a function that labels the vertices of the graph with an integer between 0, 1, 2, satisfying the condition that every vertex labeled by 0 is adjacent to at least one vertex labeled by 2. The weight of a Roman Dominating Function is the sum of all the labels, and the minimum weig

APA, Harvard, Vancouver, ISO, and other styles

7

Ho, Yiu Yu. "Global secure sets of trees and grid-like graphs." Doctoral diss., University of Central Florida, 2011. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4922.

Full text

Abstract:

However, as will be demonstrated in Chapter 1, a defensive alliance may not be able to properly defend itself when multiple members are under attack at the same time. The concept of secure sets is introduced in (BDH07) for exactly this purpose. The non-empty set S is a secure set if every subset Xsubset of]S, with the assistance of vertices in S, can successfully defend against simultaneous attacks coming from vertices outside of S. The exact definition of simultaneous attacks and how such attacks may be defended will be provided in Chapter 1. In (BDH07), the authors presented an interesting c

APA, Harvard, Vancouver, ISO, and other styles

8

Rudoy, Mikhail. "Hamiltonian cycle and related problems : vertex-breaking, grid graphs, and Rubik's Cubes." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/113112.

Full text

Abstract:

Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 123-124).<br>In this thesis, we analyze the computational complexity of several problems related to the Hamiltonian Cycle problem. We begin by introducing a new problem, which we call Tree-Residue Vertex-Breaking (TRVB). Giv

APA, Harvard, Vancouver, ISO, and other styles

9

Mustata, Irina [Verfasser], Stefan [Akademischer Betreuer] Felsner, and Ekkehard [Akademischer Betreuer] Köhler. "On subclasses of grid intersection graphs / Irina Mustata. Gutachter: Ekkehard Köhler. Betreuer: Stefan Felsner." Berlin : Technische Universität Berlin, 2014. http://d-nb.info/1066550573/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Oprisan, Sorinel. "A Multi-Dimensional Width-Bounded Geometric Separator and its Applications to Protein Folding." ScholarWorks@UNO, 2005. http://scholarworks.uno.edu/td/238.

Full text

Abstract:

We used a divide-and-conquer algorithm to recursively solve the two-dimensional problem of protein folding of an HP sequence with the maximum number of H-H contacts. We derived both lower and upper bounds for the algorithmic complexity by using the newly introduced concept of multi-directional width-bounded geometric separator. We proved that for a grid graph G with n grid points P, there exists a balanced separator A subseteq P$ such that A has less than or equal to 1.02074 sqrt{n} points, and G-A has two disconnected subgraphs with less than or equal to {2over 3}n nodes on each subg

APA, Harvard, Vancouver, ISO, and other styles

11

Rinne, Vidar. "A Zoomable 3D User Interface using Uniform Grids and Scene Graphs." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-13360.

Full text

Abstract:

Zoomable user interfaces (ZUIs) have been studied for a long time and many applications are built upon them. Most applications, however, only use two dimensions to express the content. This report presents a solution using all three dimensions where the base features are built as a framework with uniform grids and scene graphs as primary data structures. The purpose of these data structures is to improve performance while maintaining flexibility when creating and handling three-dimensional objects. A 3D-ZUI is able to represent the view of the world and its objects in a more lifelike manner. I

APA, Harvard, Vancouver, ISO, and other styles

12

Toch, Lamiel. "Contributions aux techniques d’ordonnancement sur plates-formes parallèles ou distribuées." Electronic Thesis or Diss., Besançon, 2012. http://www.theses.fr/2012BESA2045.

Full text

Abstract:

Les travaux présentés dans ce document portent sur l'ordonnancement d'applications parallèles sur des plates-formes parallèles (cluster) ou distribuées (grilles de calcul). Dans nos travaux de recherche nous nous sommes concentrés sur l'ordonnancement d'applications modélisées par un DAG, graphe orienté sans cycle, pour les grilles de calcul et sur l'ordonnancement pour les (cluster, machines multiprocesseurs) de programmes parallèles (jobs parallèles) représentés sous la forme de surface rectangulaire dont les deux dimensions sont le nombre de processeurs requis et la durée d'exécution. Les r

APA, Harvard, Vancouver, ISO, and other styles

13

Vandomme, Elise. "Contributions to combinatorics on words in an abelian context and covering problems in graphs." Thesis, Université Grenoble Alpes (ComUE), 2015. http://www.theses.fr/2015GRENM010/document.

Full text

Abstract:

Cette dissertation se divise en deux parties, distinctes mais connexes, qui sont le reflet de la cotutelle. Nous étudions et résolvons des problèmes concernant d'une part la combinatoire des mots dans un contexte abélien et d'autre part des problèmes de couverture dans des graphes. Chaque question fait l'objet d'un chapitre. En combinatoire des mots, le premier problème considéré s'intéresse à la régularité des suites au sens défini par Allouche et Shallit. Nous montrons qu'une suite qui satisfait une certaine propriété de symétrie est 2-régulière. Ensuite, nous appliquons ce théorème pour mon

APA, Harvard, Vancouver, ISO, and other styles

14

Talon, Alexandre. "Intensive use of computing resources for dominations in grids and other combinatorial problems." Thesis, Lyon, 2019. http://www.theses.fr/2019LYSEN079.

Full text

Abstract:

Nous cherchons à prouver de nouveaux résultats en théorie des graphes et combinatoire grâce à la vitesse de calcul des ordinateurs, couplée à des algorithmes astucieux. Nous traitons quatre problèmes. Le théorème des quatre couleurs affirme que toute carte d’un monde où les pays sont connexes peut être coloriée avec 4 couleurs sans que deux pays voisins aient la même couleur. Il a été le premier résultat prouvé en utilisant l'ordinateur, en 1989. Nous souhaitions automatiser encore plus cette preuve. Nous expliquons la preuve et fournissons un programme qui permet de la réétablir, ainsi que d'

APA, Harvard, Vancouver, ISO, and other styles

15

Gladkikh, Egor. "Optimisation de l'architecture des réseaux de distribution d'énergie électrique." Thesis, Université Grenoble Alpes (ComUE), 2015. http://www.theses.fr/2015GREAT055/document.

Full text

Abstract:

Pour faire face aux mutations du paysage énergétique, les réseaux de distribution d'électricité sont soumis à des exigences de fonctionnement avec des indices de fiabilité à garantir. Dans les années à venir, de grands investissements sont prévus pour la construction des réseaux électriques flexibles, cohérents et efficaces, basés sur de nouvelles architectures et des solutions techniques innovantes, adaptatifs à l'essor des énergies renouvelables. En prenant en compte ces besoins industriels sur le développement des réseaux de distribution du futur, nous proposons, dans cette thèse, une appro

APA, Harvard, Vancouver, ISO, and other styles

16

Wang, Hongjian. "Cellular matrix for parallel k-means and local search to Euclidean grid matching." Thesis, Belfort-Montbéliard, 2015. http://www.theses.fr/2015BELF0280/document.

Full text

Abstract:

Dans cette thèse, nous proposons un modèle de calcul parallèle, appelé « matrice cellulaire », pour apporter des réponses aux problématiques de calcul parallèle appliqué à la résolution de problèmes d’appariement de graphes euclidiens. Ces problèmes d’optimisation NP-difficiles font intervenir des données réparties dans le plan et des structures élastiques représentées par des graphes qui doivent s’apparier aux données. Ils recouvrent des problèmes connus sous des appellations diverses telles que geometric k-means, elastic net, topographic mapping, elastic image matching. Ils permettent de mod

APA, Harvard, Vancouver, ISO, and other styles

17

CUNHA, FILHO Gilberto. "OGST (Opportunistic Grid Simulation Tool): uma ferramenta de simulação para avaliação de estratégias de escalonamento de aplicações em grades oportunistas." Universidade Federal do Maranhão, 2009. http://tedebc.ufma.br:8080/jspui/handle/tede/1842.

Full text

Abstract:

Submitted by Maria Aparecida (cidazen@gmail.com) on 2017-08-18T14:43:06Z No. of bitstreams: 1 Gilberto.pdf: 2769310 bytes, checksum: 210d2e0115f0c134b325cbf3a2354263 (MD5)<br>Made available in DSpace on 2017-08-18T14:43:06Z (GMT). No. of bitstreams: 1 Gilberto.pdf: 2769310 bytes, checksum: 210d2e0115f0c134b325cbf3a2354263 (MD5) Previous issue date: 2009-02-13<br>CAPES<br>During the development of Grid middleware systems, researchers often employ simulation tools and techniques for validating new concepts and implementations. Simulation tools play a fundamental role on the development of Grid

APA, Harvard, Vancouver, ISO, and other styles

18

Barbosa, Rodrigo Moreira. "MobiGrid: arcabouço para agentes móveis em ambiente de grades computacionais." Universidade de São Paulo, 2007. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-04052007-175707/.

Full text

Abstract:

Este texto apresenta nosso projeto de implementação de um arcabouço de suporte a agentes móveis dentro de um ambiente de grade denominado InteGrade. Nosso arcabouço - MobiGrid - foi criado de forma a permitir que aplicações seqüenciais longas possam ser executadas em uma rede de estações de trabalho pessoais. Os agentes móveis são utilizados para encapsular essas aplicações com longo tempo de processamento. O encapsulamento de uma aplicação com longo tempo de processamento dentro de um agente móvel é o que denominamos como tarefa. Sendo assim, as tarefas podem migrar sempre que a máquina é req

APA, Harvard, Vancouver, ISO, and other styles

19

Kohler, Iris. "Graph Theoretical Modelling of Electrical Distribution Grids." DigitalCommons@CalPoly, 2021. https://digitalcommons.calpoly.edu/theses/2301.

Full text

Abstract:

This thesis deals with the applications of graph theory towards the electrical distribution networks that transmit electricity from the generators that produce it and the consumers that use it. Specifically, we establish the substation and bus network as graph theoretical models for this major piece of electrical infrastructure. We also generate substation and bus networks for a wide range of existing data from both synthetic and real grids and show several properties of these graphs, such as density, degeneracy, and planarity. We also motivate future research into the definition of a graph fa

APA, Harvard, Vancouver, ISO, and other styles

20

Teixeira, Fabiano Costa. "Grid Anywhere: Um middleware extensível para grades computacionais desktop." Universidade de São Paulo, 2012. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-07122012-091005/.

Full text

Abstract:

Esta tese de doutorado apresenta investigações, modelos e implementações de um middleware para grades computacionais denominado Grid Anywhere. Essa plataforma tem como objetivo viabilizar a construção de grades computacionais que permitam um maior número de provedores e consumidores de recursos. Para isso, são apresentadas soluções para gerenciamento de segurança, carregamento de aplicações, hospedagem de objetos, execução remota de métodos, desenvolvimento de aplicações e transporte alternativo de mensagens SOAP (utilizando o sistema de televisão digital interativa e encapsulando uma mensagem

APA, Harvard, Vancouver, ISO, and other styles

21

Scorsatto, Glauber. "GrAMoS : serviço para a monitoração de acordos em Grid." reponame:Repositório Institucional da UnB, 2007. http://repositorio.unb.br/handle/10482/1385.

Full text

Abstract:

Dissertação (mestrado)—Universidade de Brasília, Instituto de Ciências Exatas, Departamento de Ciência da Computação, 2007.<br>Submitted by Luis Felipe Souza (luis_felas@globo.com) on 2009-01-05T14:12:55Z No. of bitstreams: 1 Dissertacao_2007_GlauberScorsatto.pdf: 2122593 bytes, checksum: 53c097affeb6a78e961a465da8c004f1 (MD5)<br>Approved for entry into archive by Georgia Fernandes(georgia@bce.unb.br) on 2009-03-02T19:52:14Z (GMT) No. of bitstreams: 1 Dissertacao_2007_GlauberScorsatto.pdf: 2122593 bytes, checksum: 53c097affeb6a78e961a465da8c004f1 (MD5)<br>Made available in DSpace on 2009-03

APA, Harvard, Vancouver, ISO, and other styles

22

Linck, Guilherme. "UM COMPONENTE PARA EXPLORAÇÃO DA CAPACIDADE DE PROCESSAMENTO DE GPUS EM GRADES COMPUTACIONAIS." Universidade Federal de Santa Maria, 2010. http://repositorio.ufsm.br/handle/1/5369.

Full text

Abstract:

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior<br>Computer grids emerged in the 90 s with the goal of using geographically dispersed computers for high performance computing. Through grids, computational power of a supercomputer can be reached in a simple, efficient and inexpensive way. Such benefits led to highlights in researchs of computer grids. Recently, appeared on market graphics adapter cards whose computational power overcomes, and by a wide margin, even the most modern processors commonly used. This led to researchs that resulted in programming techniques relatively easy

APA, Harvard, Vancouver, ISO, and other styles

23

Laine, Scott T. "The grid bracing problem and a generalization." Link to electronic thesis, 2006. http://www.wpi.edu/Pubs/ETD/Available/etd-050106-132458/.

Full text

Abstract:

Thesis (M.S.)--Worcester Polytechnic Institute.<br>Keywords: Unit Grid bracing, Infinitesimal motion, Rigidity Matrix, Rigidity Theory, Bracing a Unit Grid with a Window. Includes bibliographical references (p.57).

APA, Harvard, Vancouver, ISO, and other styles

24

Bittencourt, Luiz Fernando 1981. "Algoritmos para escalonamento de tarefas dependentes representadas por grafos acíclicos direcionados em grades computacionais." [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275815.

Full text

Abstract:

Orientador: Edmundo Roberto Mauro Madeira<br>Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Computação<br>Made available in DSpace on 2018-08-16T05:33:50Z (GMT). No. of bitstreams: 1 Bittencourt_LuizFernando_D.pdf: 2691554 bytes, checksum: b936bb837e62d8c4b7bacaeaae71e167 (MD5) Previous issue date: 2010<br>Resumo: Grades computacionais são sistemas distribuídos compartilhados potencialmente grandes compostos por recursos heterogêneos que são ligados através de uma rede com enlaces heterogêneos. Esses sistemas tornaram-se ambientes largamente difundidos para execução de ta

APA, Harvard, Vancouver, ISO, and other styles

25

Vidal, Alexandre César Tavares. "Abordagem semântica aplicada à integração e gerenciamento de recursos e aplicações em grades computacionais." Universidade de São Paulo, 2007. http://www.teses.usp.br/teses/disponiveis/3/3142/tde-28032008-175037/.

Full text

Abstract:

O domínio de grades computacionais é fortemente associado ao compartilhamento de recursos para a resolução de problemas em ambientes dinâmicos e heterogê- neos. Reutilizar aplicações armazenadas na grade e alocar recursos para atender os requisitos das aplicações são tarefas essenciais na grade e dependem da qualidade das informações disponíveis. O presente trabalho propõe uma abordagem semântica para a construção de um serviço de metadados sobre grades e sobre as aplicações nelas disponibilizadas. A abordagem proposta explora a realização de inferência sobre ontologias de aplicações e recurso

APA, Harvard, Vancouver, ISO, and other styles

26

Camargo, Raphael Yokoingawa de. "\"Armazenamento distribuído de dados e checkpointing de aplicações paralelas em grades oportunistas\"." Universidade de São Paulo, 2007. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-30082007-115609/.

Full text

Abstract:

Grades computacionais oportunistas utilizam recursos ociosos de máquinas compartilhadas para executar aplicações que necessitam de um alto poder computacional e/ou trabalham com grandes quantidades de dados. Mas a execução de aplicações paralelas computacionalmente intensivas em ambientes dinâmicos e heterogêneos, como grades computacionais oportunistas, é uma tarefa difícil. Máquinas podem falhar, ficar inacessíveis ou passar de ociosas para ocupadas inesperadamente, comprometendo a execução de aplicações. Um mecanismo de tolerância a falhas que dê suporte a arquiteturas heterogêneas é um imp

APA, Harvard, Vancouver, ISO, and other styles

27

Raak, Fredrik. "Investigation of Power Grid Islanding Based on Nonlinear Koopman Modes." Thesis, KTH, Elektriska energisystem, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-136834.

Full text

Abstract:

To view the electricity supply in our society as just sockets mountedin our walls with a constant voltage output is far from the truth. Inreality, the power system supplying the electricity or the grid, is themost complex man-made dynamical system there is. It demands severecontrol and safety measures to ensure a reliable supply of electric power.Throughout the world, incidents of widespread power grid failures havebeen continuously reported. The state where electricity delivery to customersis terminated by a disturbance is called a blackout. From a stateof seemingly stable operating condition

APA, Harvard, Vancouver, ISO, and other styles

28

Baldez, Raisi Natalia Lenz. "Algoritmo genético acoplado a um método multi-grid e a teoria dos grafos para determinação da estrutura de equilíbrio de aglomerados atômicos." Universidade Federal de Santa Maria, 2012. http://repositorio.ufsm.br/handle/1/9231.

Full text

Abstract:

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior<br>In this work we present a proposal to improve Genetic Algorithm method by coupling it to the techniques of discretization of the configurational space via the multi-grid methodology, and by employing a topological selection of the offsprings via graph theory. The best performance for clusters of 13 and 19 aluminum atoms shows that the multi-grid tecniques can increase the efficiency of the genetic algorithm, mainly when a more extensive search is performed in an initially sparse grid of points. We also show that a greater improveme

APA, Harvard, Vancouver, ISO, and other styles

29

Parast, Vand Hossein. "Power network and smart grids analysis from a graph theoretic perspective." Thesis, Edith Cowan University, Research Online, Perth, Western Australia, 2021. https://ro.ecu.edu.au/theses/2440.

Full text

Abstract:

The growing size and complexity of power systems has given raise to the use of complex network theory in their modelling, analysis, and synthesis. Though most of the previous studies in this area have focused on distributed control through well established protocols like synchronization and consensus, recently, a few fundamental concepts from graph theory have also been applied, for example in symmetry-based cluster synchronization. Among the existing notions of graph theory, graph symmetry is the focus of this proposal. However, there are other development around some concepts from complex ne

APA, Harvard, Vancouver, ISO, and other styles

30

Douss, Rabaa. "Squelettisation d’images en niveaux de gris et applications." Thesis, Sorbonne Paris Cité, 2015. http://www.theses.fr/2015USPCB138/document.

Full text

Abstract:

L’opération morphologique de squelettisation transforme chaque objet d’une image en une forme linéique qui préserve la topologie de ce dernier (propriété d’homotopie). Elle est largement utilisée en biométrie mais aussi dans la reconnaissance des caractères ainsi que pour l’extraction de la microarchitecture osseuse. L’objectif de cette thèse est de développer une méthode de squelettisation appliquée directement sur les niveaux de gris de l’image, ce qui a pour large avantage de s’affranchir de prétraitement comme la binarisation. Une revue des méthodes de squelettisation en niveaux de gris pe

APA, Harvard, Vancouver, ISO, and other styles

31

Aliaga, Alvaro Henry Mamani. "Estudo comparativo de técnicas de escalonamento de tarefas dependentes para grades computacionais." Universidade de São Paulo, 2011. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-21102011-162130/.

Full text

Abstract:

À medida que a ciência avança, muitas aplicações em diferentes áreas precisam de grande poder computacional. A computação em grade é uma importante alternativa para a obtenção de alto poder de processamento, no entanto, esse alto poder computacional deve ser bem aproveitado. Mediante o uso de técnicas de escalonamento especializadas, os recursos podem ser utilizados adequadamente. Atualmente existem vários algoritmos propostos para computação em grade, portanto, é necessário seguir uma boa metodologia para escolher o algoritmo que ofereça melhor desempenho, dadas determinadas características.

APA, Harvard, Vancouver, ISO, and other styles

32

GOMES, Raphael de Aquino. "Grades Computacionais Oportunistas: Alternativas para Melhorar o Desempenho das Aplicações." Universidade Federal de Goiás, 2009. http://repositorio.bc.ufg.br/tede/handle/tde/524.

Full text

Abstract:

Made available in DSpace on 2014-07-29T14:57:51Z (GMT). No. of bitstreams: 1 dissertacaoRaphaelGomes.pdf: 1868602 bytes, checksum: 672048d88b1eb45c74f869fe6794261f (MD5) Previous issue date: 2009-04-13<br>Scavenging grid computing environments are being even more used as an alternative aside traditional processing categories. This kind of system is characterized by using of communal and shared workstations and its main concern is the guarantee of performance for the user who gives its resources to the grid. This concern, and because it is an extremaly dynamic environment, causes the adoption

APA, Harvard, Vancouver, ISO, and other styles

33

陳宏達 and Wun-tat Chan. "Efficient algorithms for disjoint paths problems in grids." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1999. http://hub.hku.hk/bib/B30106497.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Chan, Wun-tat. "Efficient algorithms for disjoint paths problems in grids /." Hong Kong : University of Hong Kong, 1999. http://sunzi.lib.hku.hk/hkuto/record.jsp?B21629845.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Cedro, Daniela Medeiros. "GestÃo da QoS em Arquiteturas de Grades Computacionais Orientadas a ServiÃos." Universidade Federal do CearÃ, 2010. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=7349.

Full text

Abstract:

A crescente disponibilizaÃÃo de serviÃos atravÃs da Internet vem impondo uma demanda cada vez maior por recursos de processamento no lado servidor favorecendo a utilizaÃÃo dos Clusters de Computadores e das Grades Computacionais. Em paralelo, a engenharia de software traz novos paradigmas, como a OrientaÃÃo a ServiÃos, que impÃem novos desafios a serem tratados pelos fornecedores de serviÃos. A convergÃncia destes fatores deu origem as Arquiteturas de Grades Computacionais Orientadas a ServiÃos. Neste trabalho Ã apresentada uma proposta de arquitetura em grades computacionais orientada a servi

APA, Harvard, Vancouver, ISO, and other styles

36

GONZáLEZ, GóMEZ Mauricio. "Jeux stochastiques sur des graphes avec des applications à l’optimisation des smart-grids." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLN064.

Full text

Abstract:

Au sein de la communauté scientifique, l’étude des réseaux d’énergie suscite un vif intérêt puisque ces infrastructures deviennent de plus en plus importantes dans notre monde moderne. Des outils mathématiques avancés et complexes sont nécessaires afin de bien concevoir et mettre en œuvre ces réseaux. La précision et l’optimalité sont deux caractéristiques essentielles pour leur conception. Bien que ces deux aspects soient au cœur des méthodes formelles, leur application effective reste largement inexplorée aux réseaux d’énergie. Cela motive fortement le travail développé dans cette thèse. Un

APA, Harvard, Vancouver, ISO, and other styles

37

Liu, Chen. "Multilevel halftoning over hexagonal grids." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file 0.85 Mb., 47 p, 2006. http://wwwlib.umi.com/dissertations/fullcit/1435813.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Moutinho, André Luiz Ribeiro. "Grid computacional utilizando a arquitetura universal plug and play." Instituto Tecnológico de Aeronáutica, 2005. http://www.bd.bibl.ita.br/tde_busca/arquivo.php?codArquivo=201.

Full text

Abstract:

Devido ao grande avanço no desenvolvimento de hardware e em tecnologias de redes de alta velocidade, além da necessidade de aplicações que demandam cada vez mais poder de processamento em contextos de uso colaborativos, surge a necessidade de aplicações que aproveitem ao máximo o que as novas tecnologias de hardware e rede têm a oferecer. É neste contexto o Grid Computacional emerge como uma tecnologia inovadora no sentido de permitir a criação de aplicações distribuídas envolvendo uma ampla gama de recursos. A demanda de pesquisa nesta área ainda é grande, principalmente em algumas áreas da

APA, Harvard, Vancouver, ISO, and other styles

39

Sharp, Richard Paul. "Computational approaches for diffusive light transport finite-elements, grid adaption, and error estimation /." Columbus, Ohio : Ohio State University, 2006. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1154705561.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Anguelov, Bobby. "Video game pathfinding and improvements to discrete search on grid-based maps." Diss., University of Pretoria, 2011. http://hdl.handle.net/2263/22940.

Full text

Abstract:

The most basic requirement for any computer controlled game agent in a video game is to be able to successfully navigate the game environment. Pathfinding is an essential component of any agent navigation system. Pathfinding is, at the simplest level, a search technique for finding a route between two points in an environment. The real-time multi-agent nature of video games places extremely tight constraints on the pathfinding problem. This study aims to provide the first complete review of the current state of video game pathfinding both in regards to the graph search algorithms employed as w

APA, Harvard, Vancouver, ISO, and other styles

41

Dantas, Rennan Ferreira. "Problemas de cÃdigo de identificaÃÃo em grades." Universidade Federal do CearÃ, 2014. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=14228.

Full text

Abstract:

CoordenaÃÃo de AperfeÃoamento de Pessoal de NÃvel Superior<br>O problema do cÃdigo de identificaÃÃo foi introduzido em 1998 por Karpovsky com a finalidade de ajudar no diagnÃstico de falhas em sistemas computacionais com multiprocessadores Desde entÃo o estudo sobre esses cÃdigos e suas variantes tem sido desenvolvido Antoine Lobstein mantÃm uma bibliografia com mais de 200 artigos sobre o assunto A ideia do problema consiste em identificar qualquer vÃrtice do grafo utilizando apenas o seu conjunto de identificaÃÃo que sÃo os vÃrtices de sua vizinhanÃa fechada que estÃo no cÃdigo de identifica

APA, Harvard, Vancouver, ISO, and other styles

42

Foshee, Jacob Wesley. "Resolution independent curved seams in clothing animation using a regular particle grid." Texas A&M University, 2004. http://hdl.handle.net/1969.1/1226.

Full text

Abstract:

We present a method for representing seams in clothing animation, and its application in simulation level of detail. Specifically we consider cloth represented as a regular grid of particles connected by spring-dampers, and a seam specified by a closed set of parametric trim curves in the cloth domain. Conventional cloth animation requires the tessellation of seams so that they are handled uniformly by the dynamics process. Our goal is a seam definition which does not constrain the attached clothing panels to be of the same resolution, or even constant resolution, while not being a hindrance t

APA, Harvard, Vancouver, ISO, and other styles

43

Isapour, Chehardeh Maziar. "AUTOMATIC RECONFIGURATION OF RADIAL DISTRIBUTION NETWORK FOR RELIABILITY ASSESSMENT USING THE CIRCUIT GRAPH." OpenSIUC, 2018. https://opensiuc.lib.siu.edu/dissertations/1572.

Full text

Abstract:

The problem of optimum restoration after occurrence the outages in a distribution network is an important issue in smart grids. In this kind of networks remote-controlled switches, alternative sources and grid-connected distributed generators (DG) are employed. Therefore, the reliability of the system (corresponding to the frequency of failures and the duration of interruptions) is improved by operating the switches to resupply a part of interrupted system during the repair time. To evaluate the reliability indices in smart grids, neglecting the restoration during the repair time causes the wr

APA, Harvard, Vancouver, ISO, and other styles

44

Menezes, Denison [UNESP]. "Geração de algoritmos de escalonamento para simulação de grades computacionais." Universidade Estadual Paulista (UNESP), 2012. http://hdl.handle.net/11449/89339.

Full text

Abstract:

Made available in DSpace on 2014-06-11T19:24:01Z (GMT). No. of bitstreams: 0 Previous issue date: 2012-04-13Bitstream added on 2014-06-13T18:20:04Z : No. of bitstreams: 1 menezes_d_me_sjrp.pdf: 3182347 bytes, checksum: 52e757c22a6f90de1feb14d78b6536f0 (MD5)<br>Universidade Estadual Paulista (UNESP)<br>A crescente necessidade por poder computacional, unida com o progresso atingido nos computadores pessoais e redes de interconexão, fez surgir diversas propostas, tais como grades computacionais, para tornar a computação de alto desempenho mais barata e acessível. Como contraponto, a maior ace

APA, Harvard, Vancouver, ISO, and other styles

45

Brunner, David, Guido Brunnett, and Robin Strand. "A High-Performance Parallel Thinning Approach Using a Non-cubic Grid Structure." Universitätsbibliothek Chemnitz, 2006. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200601714.

Full text

Abstract:

In the past years the so-called body-centered cubic grid (bcc) has been examined and proved to be superior over Cartesian lattices for certain applications. Our work deals with parallel thinning on these bcc grids. We introduce conditions which are sufficient for retaining topology and suggest additional conditions to influence the shape of the resulting skeleton. We further developed an algorithm to extract curve skeletons out of 3d objects in parallel which we also present here. We show in our results that the developed thinning approach on bcc grids is extremely efficient.

APA, Harvard, Vancouver, ISO, and other styles

46

Pedroso, Edson Tessarini. "Segurança em grades computacionais." [s.n.], 2006. http://repositorio.unicamp.br/jspui/handle/REPOSIP/276234.

Full text

Abstract:

Orientador: Ricardo Dahab<br>Dissertação (mestrado profissional) - Universidade Estadual de Campinas, Instituto de Computação<br>Made available in DSpace on 2018-08-08T18:08:23Z (GMT). No. of bitstreams: 1 Pedroso_EdsonTessarini_M.pdf: 1601998 bytes, checksum: a37e50088eb3b06977e4d812a3951695 (MD5) Previous issue date: 2006<br>Resumo: Grade computacional é um conceito que explora as potencialidades das redes de computadores, com o objetivo específico de disponibilizar camadas virtuais que permitem a um usuário ter acesso a aplicações altamente exigentes, bem como aderir a comunidades virtuai

APA, Harvard, Vancouver, ISO, and other styles

47

Menezes, Denison. "Geração de algoritmos de escalonamento para simulação de grades computacionais /." São José do Rio Preto : [s.n.], 2012. http://hdl.handle.net/11449/89339.

Full text

Abstract:

Orientador: Aleardo Manacero Junior<br>Banca: Mário Antônio Ribeiro Dantas<br>Banca: Marcos Antônio Cavenagui<br>Resumo: A crescente necessidade por poder computacional, unida com o progresso atingido nos computadores pessoais e redes de interconexão, fez surgir diversas propostas, tais como grades computacionais, para tornar a computação de alto desempenho mais barata e acessível. Como contraponto, a maior acessibilidade aos recursos para computação de alto desempenho oferecida pelas grades, criou um universo de usuários tipicamente não especialistas em computação paralela, aumentando a deman

APA, Harvard, Vancouver, ISO, and other styles

48

Löffler, Andre [Verfasser], Alexander [Gutachter] Wolff, and Steven [Gutachter] Chaplick. "Constrained Graph Layouts: Vertices on the Outer Face and on the Integer Grid / Andre Löffler ; Gutachter: Alexander Wolff, Steven Chaplick." Würzburg : Würzburg University Press, 2021. http://d-nb.info/1225684897/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Sharp, Richard Paul Jr. "Computational approaches for diffusive light transport: finite-elements, grid adaption, and error estimation." The Ohio State University, 2006. http://rave.ohiolink.edu/etdc/view?acc_num=osu1154705561.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Bianchini, Calebe de Paula. "Um ambiente para programação orientada a objetos distribuídos e paralelos em grades computacionais." Universidade de São Paulo, 2009. http://www.teses.usp.br/teses/disponiveis/3/3141/tde-26032009-171120/.

Full text

Abstract:

Grades Computacionais (grid computing) já é uma realidade tanto no meio acadêmico quanto no meio empresarial. Seu uso se tornou popular principalmente devido à divulgação dos trabalhos nesta área e pela propaganda de produtos e softwares que oferecem essa idéia. Apesar disso, ambientes para o desenvolvimento de aplicações orientadas a objetos em Java para uma infra-estrutura de grid ainda é escasso. Algumas iniciativas oferecem bibliotecas para este desenvolvimento. Outras utilizam paradigmas diferentes, como o de passagem de mensagem, para o desenvolvimento de aplicações. Além disso, a própri

APA, Harvard, Vancouver, ISO, and other styles

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!