Np Complete
Mostrando 13-24 de 66 artigos, teses e dissertações.
-
13. Geração de colunas para o problema de dimensionamento de lotes de produção com limitações de capacidade / Column generation heuristics for capacitated lotsizing problem
The Capacitated Lot Sizing Problem (CLSP) consists in determining a production plan such that all demands are met and the total costs of production, inventory and setup are minimized. Since the problem to find a feasible solution to the CLSP with setup times is NP-complete, large problem instances have been solved by heuristic methods. In this dissertation,
Publicado em: 2009
-
14. An approach to incompletely specified finite state machine minimization / Uma estratégia para a minimização de máquinas de estados finitos parciais
Finite State Machines are largely used on Software Engineering to model systems specifications. In these models, designers may inadvertently include redundant states, i.e., states which exhibit the same input/output behavior. The absence of such states brings benefits to the modeling activities, reducing the complexity and taking less physical resources on i
Publicado em: 2009
-
15. Mechanisms underlying the differentiation of stem cells from human exfoliated deciduous teeth (SHED) into odontoblasts and endothelial cells / Mecanismos envolvidos na diferenciação de células-tronco de dentes decíduos exfoliados humanos (SHED) em odontoblastos e células endoteliais
Dental pulp tissue engineering aims to replace the inflamed or necrotic pulp by a healthy and functionally competent tissue able to form new dentin in order to repair lost structure. The purposes of this work were: to evaluate the differentiation ability of stem cells from human exfoliated deciduous teeth (SHED) into functional odontoblasts, showing the form
Publicado em: 2009
-
16. Helly property, clique graphs, complementary graph classes, and sandwich problems
A sandwich problem for property Π asks whether there exists a sandwich graph of a given pair of graphs which has the desired property Π. Graph sandwich problems were first defined in the context of Computational Biology as natural generalizations of recognition problems. We contribute to the study of the complexity of graph sandwich problems by considering
Journal of the Brazilian Computer Society. Publicado em: 2008
-
17. REFEREE ASSIGNMENT IN SPORT TOURNAMENTS: MONO AND MULTI-CRITERIUM ALGORITHMS AND APPLICATIONS / ATRIBUIÇÃO DE ÁRBITROS EM COMPETIÇÕES ESPORTIVAS: ALGORITMOS E APLICAÇÕES MONO MULTI-CRITÉRIO
Optimization in sports is a field of increasing interest. Combinatorial optimization techniques have been applied e.g. to game scheduling and playoff elimination. A problem that arises in competition management is the assignment of referees to games already scheduled. There are a number of rules and objectives that should be taken into account when referees
Publicado em: 2008
-
18. inexact graph correspondence / Correspondência inexata entre grafos.
Let GI = (VI ,AI) and GM = (VM,AM) be two simple graphs. A mapping from GI to GM is an association set, such that each vertex in VI is associated to a vertex in VM, and each edge in AI is associated to a pair of vertices of VM. A cost is defined to each possible association. The inexact graph correspondence problem (IGCP) consists in finding a mapping from G
Publicado em: 2008
-
19. AST Um modelo para automaÃÃo de horÃrios escolares
The work here presented is about a model for automation of school timetable. It is tailored to deal with most of the restrictions found in the Brazilian schools. It also studies the relation between the constraints of the problem and its theoretical complexity. The school timetable problem is NP-complete even in the simplest cases, where the constraints are
Publicado em: 2008
-
20. Uma heuristica para o problema de classificação de classificação de conferências explorando relacionamentos múltiplos e indiretos
Extracting usable knowledge from large amounts of data has become one of the main challenges to a variety of fields, such as scientific, industrial or governmental areas. This task requires the data to be represented in a way that not only is the relational information captured, but that it also allows an effective and efficient mining of these data and the
Publicado em: 2008
-
21. Escalonamento genético FJSP com tempo de configuração dependente de seqüência
A Job Shop Problem (JSP) may be considered a hard combinatorial optimization problem. Although the various problem solution methods and processors technological evolutions, scheduling problems still figure out as hard to solve problem, mainly due its combinatorial nature which characterize them as NP-Complete Problems. This work present a genetic algorithm m
Publicado em: 2007
-
22. Multialinhamento de seqüências biológicas utilizando algoritmos genéticos / Biological multialignment sequence using genetic algorithms
Multialignment of biological sequences is one of the most frequently used activities in bioinformatics. The results provided by sequence alignment are used in the solution of other bioinformatics problems. Since a multialignment procedure is one of the first steps of many bioinformatics problems, the condition of an alignment affects the quality of the resul
Publicado em: 2006
-
23. Alocação de Tarefas Paralelas Comunicantes em Ambientes Distribuídos Heterogêneos
Distributed systems have been widely used in the resolution of problems that demand a large amount of processing time, because they allow the simultaneous utilization of many computational resources. Many machines with a distributed architecture have been proposed during the years. Among these are computer clusters, which are distributed systems composed of
Publicado em: 2006
-
24. CRYPTO-COMPRESSION PREFIX CODING / CODIFICAÇÃO LIVRE DE PREFIXO PARA CRIPTO-COMPRESSÃO
Data compression and encryption are essential features when digital data is stored or transmitted over insecure channels. Usually, we apply two sequential operations: first, we apply data compression to save disk space and to reduce transmission costs, and second, data encryption to provide confidentiality. This solution works fine for most applications, but
Publicado em: 2006