Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Candido F. X. de Mendonça"'
Autor:
Candido F. X. de Mendonça, Celina M. H. de Figueiredo, Luerbio Faria, Letícia Rodrigues Bueno, Rodrigo de A. Hausen
Publikováno v:
Electronic Notes in Discrete Mathematics. 37:291-296
The Kneser graph K ( n , k ) has all k-subsets of an n-set as its vertices and two subsets are adjacent if they are disjoint. Lovasz conjectured that every connected vertex-transitive graph has a hamiltonian path. For n ⩾ 2 k + 1 , the Kneser graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b12ac6d85daf3e58683bb6b4bf7648c
https://doi.org/10.1016/j.endm.2011.05.050
https://doi.org/10.1016/j.endm.2011.05.050
Autor:
Antonio E. Bresciani, Cláudio Augusto Oller do Nascimento, Candido F. X. de Mendonça, Rita M.B. Alves
Publikováno v:
Computers & Chemical Engineering. 34:1962-1968
In this study, the concept of cellular automata is applied in an innovative way to simulate the separation of phases in a water/oil emulsion. The velocity of the water droplets is calculated by the balance of forces acting on a pair of droplets in a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b9ab176513a255ea2bb3fb5326db158
https://doi.org/10.1016/j.compchemeng.2010.07.006
https://doi.org/10.1016/j.compchemeng.2010.07.006
Autor:
Candido F. X. de Mendonça, Allainclair Flausino dos Santos, Antônio G. N. Novaes, Ademir Aparecido Constantino
Publikováno v:
ICEIS (1)
In this paper we address the problem of defining a work assignment for train drivers within a monthly planning horizon with even distribution of satisfaction based on a real-would problem. We propose an utility function, in order to measure the indiv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0c43fcf9a7800f23812206321f1324ea
https://doi.org/10.5220/0005364505930602
https://doi.org/10.5220/0005364505930602
Autor:
Jorge Stolfi, Luerbio Faria, Sylvain Gravier, Candido F. X. de Mendonça, Celina M. H. de Figueiredo
Publikováno v:
Discrete Applied Mathematics. 154(13):1774-1782
The nonplanar vertex deletion or vertex deletion vd(G) of a graph G is the smallest nonnegative integer k, such that the removal of k vertices from G produces a planar graph G′. In this case G′ is said to be a maximum planar induced subgraph of G
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::02e40c9b9baac720a6b73c25047dfc87
Autor:
Luerbio Faria, Sylvain Gravier, Celina M. H. de Figueiredo, Jorge Stolfi, Candido F. X. de Mendonça
Publikováno v:
Electronic Notes in Discrete Mathematics. 18:121-126
The non planar vertex deletion v d ( G ) , of a graph G is the smallest positive integer k, such that the removal of k vertices from G produces a planar graph. We solve a problem proposed by Yannakakis: find the threshold for the maximum degree of a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::91325280cbafcd6fbbb7fc2a8a060fdb
https://doi.org/10.1016/j.endm.2004.06.019
https://doi.org/10.1016/j.endm.2004.06.019
Autor:
Wesley Romão, Candido F. X. de Mendonça, Everton Luiz de Melo, Douglas Baroni Rizzato, Ademir Aparecido Constantino, Dario Landa-Silva
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
This paper tackles a Nurse Scheduling Problem which consists of generating work schedules for a set of nurses while considering their shift preferences and other requirements. The objective is to maximize the satisfaction of nurses? preferences and m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::03ff1f40f741a1aaf4689472fb40f8c5
http://eprints.nottingham.ac.uk/31328/
http://eprints.nottingham.ac.uk/31328/
Autor:
Dario Landa-Silva, Ademir Aparecido Constantino, Rodrigo Lankaites Pinheiro, Candido F. X. de Mendonça
Publikováno v:
ICEIS (1)
A non-planar graph can only be planarized if it is structurally modified. This work presents a new heuristic algorithm that uses vertices deletion to modify a non-planar graph in order to obtain a planar subgraph. The proposed algorithm aims to delet
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::528a32ea361a9b4be21e28622b519a4e
http://eprints.nottingham.ac.uk/31330/
http://eprints.nottingham.ac.uk/31330/
Water is used in petroleum desalting units to dilute and remove the salted water droplets that the crude oil contains. The basic processes promote the coalescence of small droplets of conducting water dispersed in a crude oil emulsion. In order to ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5fc529ce174c51164c2afe3b890f59c
https://doi.org/10.1016/s1570-7946(09)70715-1
https://doi.org/10.1016/s1570-7946(09)70715-1
Autor:
Candido F. X. de Mendonça, José J. Lunazzi, Cesar Augusto De Carvalho Vannini, Alexandre X. Falcão
Publikováno v:
Medical Imaging 1999: Image Display.
Display systems relying on computer graphics techniques usually create 2.5D image display on a 2D screen. To obtain 3D image display, most systems uses auxiliary devices or viewing tricks, such as polarized glasses, virtual reality helmet, detection
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fdea7c085c98700b0a31c384854e9b66
https://doi.org/10.1117/12.349460
https://doi.org/10.1117/12.349460