Algorithms In Graphs
Mostrando 25-36 de 40 artigos, teses e dissertações.
-
25. MODELS AND ALGORITHMS FOR THE DIAMETER CONSTRAINED MINIMUM SPANNING TREE PROBLEM / MODELOS E ALGORITMOS PARA O PROBLEMA DA ÁRVORE GERADORA DE CUSTO MÍNIMO COM RESTRIÇÃO DE DIÂMETRO
In this work, models and approximation algorithms to solve the Diameter Constrained Minimum Spanning Tree Problem (AGMD) are proposed. This problem typically models network design applications where all vertices must communicate with each other at a minimum cost, while meeting a given quality requirement. The formulations proposed by Achuthan and Caccetta ar
Publicado em: 2006
-
26. Electrocardiogram evaluation under a mathematical approach. / Estudo do eletrocardiograma sob uma abordagem matemática.
The electrocardiogram gives information related to the passage of an electric pulse through the heart and, therefore, to his state function. Since the beginning of electrocardiogram utilization, thanks to the work of Willem Einthoven building the first machine capable of measuring the electric pulse non-invasively and with sensitivity enough to be able to pr
Publicado em: 2006
-
27. Algoritmos para alocação de recursos em arquiteturas reconfiguraveis
Recent work in reconfigurable architectures shows that they ofter a better performance than general purpose processors (GPPs), while offering more exibility than ASICs (Application Specific Integrated Circuits). A reconfigurable architecture can be adapted to implement different applications, thus allowing the specialization of the hardware according to the
Publicado em: 2005
-
28. Agente topológico de aprendizado por reforço / Topological reinforcement learning agent
Reinforcement Learning (RL) methods have shown to be a good choice for decision-making problems due to their flexible and adaptive characteristics. Despite such promising features, RL methods often have their practical application restricted to small or medium size (at state, or state-action, space) problems mainly because of their standard strategies for va
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 07/04/2004
-
29. Agente topológico de aprendizado por reforço / Topological reinforcement learning agent
Reinforcement Learning (RL) methods have shown to be a good choice for decision-making problems due to their flexible and adaptive characteristics. Despite such promising features, RL methods often have their practical application restricted to small or medium size (at state, or state-action, space) problems mainly because of their standard strategies for va
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 07/04/2004
-
30. Restabelecimento de energia considerando todas as barras e chaves de um sistema de distribuição real / Energy restoration for real distribution systems considering all their buses and switches
This work investigates methodologies to automatically obtain energy restoration plans in distribution systems, involving multiple objectives that are conflicting. The reduction energy interruption indices is a permanent objective of the distribution companies in order to improve power supply. Interruptions may be carried out for maintenance or may occur due
Publicado em: 2004
-
31. LabSis : um ambiente para desenvovimento de aplicações sismicas Matlab
The Matlab package is a tool of widespread use in the academic environment, because of its advantages in simple direct programming, graphs and visualization tools. It allows initial implementations of algorithms and procedures very quickly in a series of applications. As a counterpar to the above good qualities, Matlab programs do not exhibit the computation
Publicado em: 2004
-
32. Uma abordagem para desenho de grafos baseada na utilização de times assincronos
Graph Drawing is a new area that deals with the development of techniques and algorithms whose major concern is the geometric representations of graphs. These geometric representations must follow a set of aesthetic criteria in a "nice" way. The activity of drawing graphs run into many dificulties, for example: the problem of satisfying some aesthetic criter
Publicado em: 1997
-
33. Uma ferramenta para auxilio visual ao teste e depuração de programas
The specification and main features are presented of ViewGraph, a tool designed to aid in testing and debugging tasks by providing the visualization of test information produced by POKE-TOOL [CHA91]. The main points on Structural Testing based on Data Flow Analysis, supported by POKE-TOOL,are also presented. The most important algorithms in ViewGraph are the
Publicado em: 1994
-
34. Algoritmos para emparelhamentos em grafos bipartidos
The matching problem in graphs consists in determining a vertex disjoint set M of edges of the graph. In particular, we are interested in finding maximum matchings, that is, matchings of maximum cardinality. There are many variations around this problem, the graph can be: bipartite or general, weighted or not. In this work we present the main techniques to d
Publicado em: 1993
-
35. Spectra of random graphs with given expected degrees
In the study of the spectra of power-law graphs, there are basically two competing approaches. One is to prove analogues of Wigner's semicircle law, whereas the other predicts that the eigenvalues follow a power-law distribution. Although the semicircle law and the power law have nothing in common, we will show that both approaches are essentially correc
National Academy of Sciences.
-
36. ESTGenes: Alternative Splicing From ESTs in Ensembl
We describe a novel algorithm for deriving the minimal set of nonredundant transcripts compatible with the splicing structure of a set of ESTs mapped on a genome. Sets of ESTs with compatible splicing are represented by a special type of graph. We describe the algorithms for building the graphs and for deriving the minimal set of transcripts from the graphs
Cold Spring Harbor Laboratory Press.