Skip to content

Carlile Lavor

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

12

Venues

7

Active years

2009–2020

Best venue rank

C

Where they publish

Papers

12 indexed papers, newest first.

YearVenueTitleAuthors
2020CGIAn Online Calculator for Qubits Based on Geometric Algebra.Dietmar Hildenbrand, Christian Steinmetz, Rafael Alves, Jaroslav Hrdina, Carlile Lavor
2020FedCSISMD-jeep: a New Release for Discretizable Distance Geometry Problems with Interval Data.Antonio Mucherino, Douglas Soares Gonalves, Leo Liberti, Jung-Hsin Lin, Carlile Lavor, Nelson Maculan
2016CGIAdvances on the Geometric Algebra approach to the Discretizable Molecular Distance Geometry Problem (DMDGP).Rafael Alves, Cipriano de Souza, Carlile Lavor
2016FedCSISA New Approach to the Discretization of Multidimensional Scaling.Antonio Mucherino, Warley Gramacho, Jung-Hsin Lin, Carlile Lavor
2014BigDataA Combinatorial Approach to Multidimensional Scaling.Jorge Alencar, Tibrius O. Bonates, Carlile Lavor
2014FedCSISAn adaptive branching scheme for the Branch & Prune algorithm applied to Distance Geometry.Douglas Soares Gonalves, Antonio Mucherino, Carlile Lavor
2013FedCSISEnergy-based Pruning Devices for the BP Algorithm applied to Distance Geometry.Douglas Soares Gonalves, Antonio Mucherino, Carlile Lavor
2012FedCSISOn suitable orders for discretizing Molecular Distance Geometry Problems related to protein side chains.Virginia Costa, Antonio Mucherino, Carlile Lavor, Luiz Mariano Carvalho, Nelson Maculan
2011COCOAOn the Number of Solutions of the Discretizable Molecular Distance Geometry Problem.Leo Liberti, Benot Masson, Jon Lee, Carlile Lavor, Antonio Mucherino
2010AICCSAA parallel version of the Branch & Prune algorithm for the Molecular Distance Geometry Problem.Antonio Mucherino, Carlile Lavor, Leo Liberti, El-Ghazali Talbi
2009GECCOComparisons between an exact and a metaheuristic algorithm for the molecular distance geometry problem.Antonio Mucherino, Leo Liberti, Carlile Lavor, Nelson Maculan
2009SACOn a discretizable subclass of instances of the molecular distance geometry problem.Carlile Lavor, Leo Liberti, Antonio Mucherino, Nelson Maculan