Valmir C. Barbosa: Papers

  1. Felipe da Veiga Leprevost, Diogo Borges Lima, Juliana Crestani, Yasset Perez-Riverol, Nilson Zanchin, Valmir C. Barbosa, and Paulo C. Carvalho, “Pinpointing differentially expressed domains in complex protein mixtures with the cloud service of PatternLab for Proteomics,” Journal of Proteomics, to appear.
  2. [doi] Valmir C. Barbosa, “The conduciveness of CA-rule graphs,” Artificial Life 19 (2013), 255–266.
  3. [doi] Diogo Borges, Yasset Perez-Riverol, Fabio C. S. Nogueira, Gilberto B. Domont, Jesus Noda, Felipe da Veiga Leprevost, Vladimir Besada, Felipe M. G. França, Valmir C. Barbosa, Aniel Sánchez, and Paulo C. Carvalho, “Effectively addressing complex proteomic search spaces with peptide spectrum matching,” Bioinformatics 29 (2013), 1343–1344.
  4. [doi] Fabio R. J. Vieira, José F. de Rezende, Valmir C. Barbosa, and Serge Fdida, “Local heuristic for the refinement of multi-path routing in wireless mesh networks,” Computer Networks 57 (2013), 273–285.
  5. [doi] Paulo C. Carvalho, Juliana S. G. Fischer, Tao Xu, John R. Yates III, and Valmir C. Barbosa, “PatternLab: from mass spectra to label-free differential shotgun proteomics,” Current Protocols in Bioinformatics 40 (2012), 13.19.1–13.19.18.
  6. [arxiv] Flavio B. Gonzaga, Valmir C. Barbosa, and Geraldo B. Xexéo, “The network structure of mathematical knowledge according to the Wikipedia, MathWorld, and DLMF online libraries,” December 2012.
  7. [doi] Priscila F. Aquino, Juliana S. G. Fischer, Ana G. C. Neves-Ferreira, Jonas Perales, Gilberto B. Domont, Gabriel D. T. Araujo, Valmir C. Barbosa, Jucilana Viana, Sidney R. S. Chalub, Antonia Q. Lima de Souza, Maria G. C. Carvalho, Afonso D. Leão de Souza, and Paulo C. Carvalho, “Are gastric cancer resection margin proteomic profiles more similar to those from controls or tumors?” Journal of Proteome Research 11 (2012), 5836–5842.
  8. [doi] Alexandre Sardinha, Tiago A. O. Alves, Leandro A. J. Marzulo, Felipe M. G. França, Valmir C. Barbosa, and Vítor Santos Costa, “Scheduling cyclic task graphs with SCC-Map,” Proceedings of the Third Workshop on Applications for Multi-Core Architecture, 54–59, 2012.
  9. [doi] Valmir C. Barbosa, Raul Donangelo, and Sergio R. Souza, “Quasispecies dynamics with network constraints,” Journal of Theoretical Biology 312 (2012), 114–119.
  10. [doi] Paulo C. Carvalho, John R. Yates III, and Valmir C. Barbosa, “Improving the TFold test for differential shotgun proteomics,” Bioinformatics 28 (2012), 1652–1654.
  11. [doi] Paulo C. Carvalho, Juliana S. G. Fischer, Tao Xu, Daniel Cociorva, Tiago S. Balbuena, Richard H. Valente, Jonas Perales, John R. Yates III, and Valmir C. Barbosa, “Search engine processor: filtering and organizing peptide spectrum matches,” Proteomics 12 (2012), 944–949.
  12. [doi] Fabio R. J. Vieira, José F. de Rezende, Valmir C. Barbosa, and Serge Fdida, “Scheduling links for heavy traffic on interfering routes in wireless mesh networks,” Computer Networks 56 (2012), 1584–1598.
  13. [doi] Luís O. Rigo Jr. and Valmir C. Barbosa, “Evolved preambles for MAX-SAT heuristics,” Proceedings of the International Conference on Evolutionary Computation Theory and Applications, 23–31, 2011.
  14. [doi] Rodrigo Barboza, Daniel Cociorva, Tao Xu, Valmir C. Barbosa, Jonas Perales, Richard H. Valente, Felipe M. G. França, John R. Yates III, and Paulo C. Carvalho, “Can the false-discovery rate be misleading?” Proteomics 11 (2011), 4105–4108.
  15. [arxiv] Andre Nathan and Valmir C. Barbosa, “Network algorithmics and the emergence of synchronization in cortical models,” July 2011.
  16. [doi] Andre Nathan and Valmir C. Barbosa, “Network algorithmics and the emergence of information integration in cortical models,” Physical Review E 84 (2011), 011904.
  17. [doi] Fabio R. J. Vieira and Valmir C. Barbosa, “Optimization of supply diversity for the self-assembly of simple objects in two and three dimensions,” Natural Computing 10 (2011), 551–581.
  18. [doi] Paulo C. Carvalho, Juliana S. G. Fischer, Jonas Perales, John R. Yates III, Valmir C. Barbosa, and Elias Bareinboim, “Analyzing marginal cases in differential shotgun proteomics,” Bioinformatics 27 (2011), 275–276.
  19. [doi] Valmir C. Barbosa, Raul Donangelo, and Sergio R. Souza, “Early appraisal of the fixation probability in directed networks,” Physical Review E 82 (2010), 046114.
  20. [arxiv] Fabiano de S. Oliveira and Valmir C. Barbosa, “Revisiting deadlock prevention: a probabilistic approach,” October 2010.
  21. [doi] [acm] Rodrigo S. C. Leão and Valmir C. Barbosa, “Exploiting the distribution of distances between nodes to efficiently solve the localization problem in wireless sensor networks,” Proceedings of the 5th ACM International Workshop on Performance Monitoring, Measurement and Evaluation of Heterogeneous Wireless and Wired Networks, 9–16, 2010.
  22. [doi] Valmir C. Barbosa, “Network conduciveness with application to the graph-coloring and independent-set optimization transitions,” PLoS ONE 5 (2010), e11232.
  23. [doi] Paulo C. Carvalho, John R. Yates III, and Valmir C. Barbosa, “Analyzing shotgun proteomic data with PatternLab for proteomics,” Current Protocols in Bioinformatics 30 (2010), 13.13.1–13.13.15.
  24. [doi] Juliana S. G. Fischer, Lujian Liao, Paulo C. Carvalho, Valmir C. Barbosa, Gilberto B. Domont, Maria G. C. Carvalho, and John R. Yates III, “Dynamic proteomic overview of glioblastoma cells (A172) exposed to perillyl alcohol,” Journal of Proteomics 73 (2010), 1018–1027.
  25. [doi] Paulo C. Carvalho, Xuemei Han, Tao Xu, Daniel Cociorva, Maria G. C. Carvalho, Valmir C. Barbosa, and John R. Yates III, “XDIA: improving on the label-free data-independent analysis,” Bioinformatics 26 (2010), 847–848.
  26. [doi] Andre Nathan and Valmir C. Barbosa, “Network algorithmics and the emergence of the cortical synaptic-weight distribution,” Physical Review E 81 (2010), 021916.
  27. [doi] Paulo C. Carvalho, Tao Xu, Xuemei Han, Daniel Cociorva, Valmir C. Barbosa, and John R. Yates III, “YADA: a tool for taking the most out of high-resolution spectra,” Bioinformatics 25 (2009), 2734–2736.
  28. [doi] Valmir C. Barbosa, Raul Donangelo, and Sergio R. Souza, “Network growth for enhanced natural selection,” Physical Review E 80 (2009), 026115.
  29. [doi] Rodrigo S. C. Leão and Valmir C. Barbosa, “Approximate conditional distributions of distances between nodes in a two-dimensional sensor network,” Analytical and Stochastic Modeling Techniques and Applications (K. Al-Begain, D. Fiems, and G. Horváth, Eds.), 324–338, Lecture Notes in Computer Science 5513, Springer-Verlag, Berlin, Germany, 2009.
  30. [doi] Valmir C. Barbosa, Fernando M. L. Ferreira, Daniel V. Kling, Eduardo Lopes, Fábio Protti, and Eber A. Schmitz, “Structured construction and simulation of nondeterministic stochastic activity networks,” European Journal of Operational Research 198 (2009), 266–274.
  31. [doi] Paulo C. Carvalho, Daniel Cociorva, Catherine C. L. Wong, Maria da Gloria da C. Carvalho, Valmir C. Barbosa, and John R. Yates III, “Charge prediction machine: tool for inferring precursor charge states of electron transfer dissociation tandem mass spectra,” Analytical Chemistry 81 (2009), 1996–2003.
  32. [doi] Paulo C. Carvalho, Juliana S. G. Fischer, Emily I. Chen, Gilberto B. Domont, Maria G. C. Carvalho, Wim M. Degrave, John R. Yates III, and Valmir C. Barbosa, “GO Explorer: a gene-ontology tool to aid in the interpretation of shotgun proteomics data,” Proteome Science 7 (2009), 6.
  33. [doi] Rodolfo M. Pussente and Valmir C. Barbosa, “An algorithm for clock synchronization with the gradient property in sensor networks,” Journal of Parallel and Distributed Computing 69 (2009), 261–265.
  34. [doi] Ricardo C. Corrêa and Valmir C. Barbosa, “Partially ordered distributed computations on asynchronous point-to-point networks,” Parallel Computing 35 (2009), 12–28.
  35. [doi] Rosa M. V. Figueiredo, Valmir C. Barbosa, Nelson Maculan, and Cid C. de Souza, “Acyclic orientations with path constraints,” RAIRO Operations Research 42 (2008), 455–467.
  36. [doi] Paulo C. Carvalho, Juliana S. G. Fischer, Emily I. Chen, John R. Yates III, and Valmir C. Barbosa, “PatternLab for proteomics: a tool for differential shotgun proteomics,” BMC Bioinformatics 9 (2008), 316.
  37. [doi] Elias Bareinboim and Valmir C. Barbosa, “Descents and nodal load in scale-free networks,” Physical Review E 77 (2008), 046111.
  38. [doi] Paulo C. Carvalho, Johannes Hewel, Valmir C. Barbosa, and John R. Yates III, “Identifying differences in protein expression levels by spectral counting and feature selection,” Genetics and Molecular Research 7 (2008), 342–356.
  39. [doi] Andre Nathan and Valmir C. Barbosa, “V-like formations in flocks of artificial birds,” Artificial Life 14 (2008), 179–188.
  40. [doi] Valmir C. Barbosa, Raul Donangelo, and Sergio R. Souza, “Emergence of scale-free behavior in networks from limited-horizon linking and cost trade-offs,” Physica A 387 (2008), 1016–1024.
  41. [doi] Valmir C. Barbosa, “Reachability and recoverability of sink nodes in growing acyclic directed networks,” Physica A 387 (2008), 685–693.
  42. [doi] Valmir C. Barbosa, “Distributed algorithms,” The Handbook of Computer Networks (H. Bidgoli, Ed.), volume 3, 286–297, John Wiley & Sons, Hoboken, NJ, 2008.
  43. [doi] Alexandre O. Stauffer and Valmir C. Barbosa, “Probabilistic heuristics for disseminating information in networks,” IEEE/ACM Transactions on Networking 15 (2007), 425–435.
  44. [doi] Paulo C. Carvalho, Juliana S. G. Fischer, Valmir C. Barbosa, Wim Degrave, Maria G. C. Carvalho, and Gilberto B. Domont, “Ellipsoid clustering machine: a front line to aid in disease diagnosis,” RECIIS: Electronic Journal of Communication, Information & Innovation in Health 1 (2007), Sup308–Sup315.
  45. [doi] Alexandre O. Stauffer and Valmir C. Barbosa, “Dissemination strategy for immunizing scale-free networks,” Physical Review E 74 (2006), 056105.
  46. [doi] Carlos A. G. Assis, Edil S. T. Fernandes, and Valmir C. Barbosa, “Modeling the input history of programs for improved instruction-memory performance,” The Computer Journal 49 (2006), 744–761.
  47. [doi] Rodrigo S. C. Leão and Valmir C. Barbosa, “Minimal chordal sense of direction and circulant graphs,” Mathematical Foundations of Computer Science 2006 (R. Královič and P. Urzyczyn, Eds.), 670–680, Lecture Notes in Computer Science 4162, Springer-Verlag, Berlin, Germany, 2006.
  48. [doi] Valmir C. Barbosa, Raul Donangelo, and Sergio R. Souza, “Emergence of scale-free networks from local connectivity and communication trade-offs,” Physical Review E 74 (2006), 016113.
  49. [doi] Luís O. Rigo Jr. and Valmir C. Barbosa, “Two-dimensional cellular automata and the analysis of correlated time series,” Pattern Recognition Letters 27 (2006), 1353–1360.
  50. [doi] Renato C. Dutra and Valmir C. Barbosa, “Finding routes in anonymous sensor networks,” Information Processing Letters 98 (2006), 139–144.
  51. [doi] Alexandre O. Stauffer and Valmir C. Barbosa, “Local heuristics and the emergence of spanning subgraphs in complex networks,” Theoretical Computer Science 355 (2006), 80–95.
  52. [doi] Alexandre H. L. Porto and Valmir C. Barbosa, “A methodology for determining amino-acid substitution matrices from set covers,” Applications of Evolutionary Computing (F. Rothlauf et al., Eds.), 138–148, Lecture Notes in Computer Science 3907, Springer-Verlag, Berlin, Germany, 2006.
  53. [doi] Alexandre H. L. Porto and Valmir C. Barbosa, “Multiple sequence alignment based on set covers,” Applications of Evolutionary Computing (F. Rothlauf et al., Eds.), 127–137, Lecture Notes in Computer Science 3907, Springer-Verlag, Berlin, Germany, 2006.
  54. [doi] Valmir C. Barbosa, Fernando M. N. Miranda, and Matheus C. M. Agostini, “Cell-centric heuristics for the classification of cellular automata,” Parallel Computing 32 (2006), 44–66.
  55. [arxiv] Alexandre O. Stauffer and Valmir C. Barbosa, “A study of the edge-switching Markov-chain method for the generation of random graphs,” December 2005.
  56. [arxiv] Rodrigo S. C. Leão and Valmir C. Barbosa, “6-cycle double covers of cubic graphs,” May 2005.
  57. [doi] Valmir C. Barbosa, Raul Donangelo, and Sergio R. Souza, “Directed cycles and related structures in random graphs: II—Dynamic properties,” Physica A 334 (2004), 566–582.
  58. [doi] Valmir C. Barbosa, Carlos A. G. Assis, and Josina O. do Nascimento, “Two novel evolutionary formulations of the graph coloring problem,” Journal of Combinatorial Optimization 8 (2004), 41–63.
  59. [doi] Lucia D. Penso and Valmir C. Barbosa, “A distributed algorithm to find k-dominating sets,” Discrete Applied Mathematics 141 (2004), 243–253.
  60. [doi] Luis E. Flores, Eduardo J. Aguilar, Valmir C. Barbosa, and Luís Alfredo V. de Carvalho, “A graph model for the evolution of specificity in humoral immunity,” Journal of Theoretical Biology 229 (2004), 311–325.
  61. [doi] Valmir C. Barbosa and Rubens G. Ferreira, “On the phase transitions of graph coloring and independent sets,” Physica A 343 (2004), 401–423.
  62. [doi] Valmir C. Barbosa and Luciana C. D. Campos, “A novel evolutionary formulation of the maximum independent set problem,” Journal of Combinatorial Optimization 8 (2004), 419–437.
  63. [doi] Valmir C. Barbosa, Raul Donangelo, and Sergio R. Souza, “Directed cycles and related structures in random graphs: I—Static properties,” Physica A 321 (2003), 381–397.
  64. [doi] Lúcia M. A. Drummond and Valmir C. Barbosa, “On reducing the complexity of matrix clocks,” Parallel Computing 29 (2003), 895–905.
  65. [doi] Valmir C. Barbosa, “The interleaved multichromatic number of a graph,” Annals of Combinatorics 6 (2002), 249–256.
  66. [doi] Alexandre H. L. Porto and Valmir C. Barbosa, “Finding approximate palindromes in strings,” Pattern Recognition 35 (2002), 2581–2591.
  67. [pdf] Valmir C. Barbosa, “The combinatorics of resource sharing,” Models for Parallel and Distributed Computation: Theory, Algorithmic Techniques and Applications (R. Corrêa, I. Dutra, M. Fiallos, and F. Gomes, Eds.), 27–52, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2002.
  68. [pdf] Edil S. T. Fernandes and Valmir C. Barbosa, “Monitoring the structure and behavior of programs,” Proceedings of the International Conference on Massively Parallel Computing Systems, paper 21 on CD (ISBN 0-9669530-0-2), 2002.
  69. [doi] Edil S. T. Fernandes, Valmir C. Barbosa, and Fabiano Ramos, “Instruction usage and the memory gap problem,” Proceedings of the Fourteenth Symposium on Computer Architecture and High Performance Computing, 169–175, 2002.
  70. [doi] Valmir C. Barbosa, Mario R. F. Benevides, and Felipe M. G. França, “Sharing resources at nonuniform access rates,” Theory of Computing Systems 34 (2001), 13–26.
  71. [doi] Valmir C. Barbosa, Mario R. F. Benevides, and Ayru L. Oliveira Filho, “A priority dynamics for generalized drinking philosophers,” Information Processing Letters 79 (2001), 189–195.
  72. [doi] Rodrigo Basilio, Gerson Zaverucha, and Valmir C. Barbosa, “Learning logic programs with neural networks,” Inductive Logic Programming (C. Rouveirol and M. Sebag, Eds.), 15–26, Lecture Notes in Artificial Intelligence 2157, Springer-Verlag, Berlin, Germany, 2001.
  73. [pdf] Ayru L. Oliveira Filho and Valmir C. Barbosa, “A graph-theoretic model of shared-memory legality,” Technical Report ES-531/00, Federal University of Rio de Janeiro, Brazil, April 2000.
  74. [doi] Nelson A. Hallack, Gerson Zaverucha, and Valmir C. Barbosa, “Towards a hybrid model of first-order theory refinement,” Hybrid Neural System (S. Wermter and R. Sun, Eds.), 92–106, Lecture Notes in Artificial Intelligence 1778, Springer-Verlag, Berlin, Germany, 2000.
  75. [doi] Roseli S. Wedemann, Valmir C. Barbosa, and Raul Donangelo, “Defeasible time-stepping,” Parallel Computing 25 (1999), 461–489.
  76. [doi] Valmir C. Barbosa and Jayme L. Szwarcfiter, “Generating all the acyclic orientations of an undirected graph,” Information Processing Letters 72 (1999), 71–74.
  77. [doi] Valmir C. Barbosa, Raul Donangelo, and Roseli S. Wedemann, “A BUU code for parallel computers,” International Journal of Modern Physics C 9 (1998), 573–583.
  78. [doi] Ricardo J. Machado, Valmir C. Barbosa, and Paulo A. Neves, “Learning in the combinatorial neural model,” IEEE Transactions on Neural Networks 9 (1998), 831–847.
  79. [pdf] Romulo M. de Menezes, Gerson Zaverucha, and Valmir C. Barbosa, “A penalty-function approach to rule extraction from knowledge-based neural networks,” Proceedings of the International Conference on Neural Information Processing, 1497–1500, 1998.
  80. [pdf] Valmir C. Barbosa and Mario R. F. Benevides, “A graph-theoretic characterization of AND-OR deadlocks,” Technical Report ES-472/98, Federal University of Rio de Janeiro, Brazil, July 1998.
  81. [doi] Lúcia Maria de A. Drummond and Valmir C. Barbosa, “Distributed breakpoint detection in message-passing programs,” Journal of Parallel and Distributed Computing 39 (1996), 153–167.
  82. [doi] Valmir C. Barbosa and Stella C. S. Porto, “An algorithm for FIFO message delivery among migrating tasks,” Information Processing Letters 53 (1995), 261–267.
  83. [doi] Valmir C. Barbosa, Lúcia Maria de A. Drummond, and Astrid Luise H. Hellmuth, “From distributed algorithms to Occam programs by successive refinements,” The Journal of Systems and Software 26 (1994), 257–272.
  84. [doi] Valmir C. Barbosa, Ricardo J. Machado, and Frederico dos S. Liporace, “A neural system for deforestation monitoring on Landsat images of the Amazon region,” International Journal of Approximate Reasoning 11 (1994), 321–359.
  85. [pdf] Ricardo J. Machado, Valmir C. Barbosa, Frederico dos S. Liporace, João R. dos Santos, and Adriano Venturieri, “Deforestation monitoring of the Amazon region using neural networks—a comparison between different photo-interpreters and networks,” Proceedings of the International Symposium on Resource and Environmental Monitoring, 49–55, 1994.
  86. [doi] Leila M. R. Eizirik, Valmir C. Barbosa, and Sueli B. T. Mendes, “A Bayesian-network approach to lexical disambiguation,” Cognitive Science 17 (1993), 257–283.
  87. [doi] Nalvo F. de Almeida Junior and Valmir C. Barbosa, “A string-matching algorithm for the CREW PRAM,” Information Processing Letters 47 (1993), 257–259.
  88. [doi] Ricardo J. Machado, Valmir C. Barbosa, Frederico dos S. Liporace, and Cláudia Ferlin, “Monitoring the deforestation of the Amazon region with neural networks,” Proceedings of the International Joint Conference on Neural Networks, 1239–1242, 1993.
  89. [doi] Luís Alfredo V. de Carvalho and Valmir C. Barbosa, “Fast linear system solution by neural networks,” Operations Research Letters 11 (1992), 141–145.
  90. [doi] Maria Claudia S. Boeres, Luís Alfredo V. de Carvalho, and Valmir C. Barbosa, “A faster elastic-net algorithm for the traveling salesman problem,” Proceedings of the International Joint Conference on Neural Networks, II-215–220, 1992.
  91. [doi] Eliseu M. Chaves Filho and Valmir C. Barbosa, “Time sharing in hypercube multiprocessors,” Proceedings of the IEEE Symposium on Parallel and Distributed Processing, 354–359, 1992.
  92. [pdf] Claudia F. Portella and Valmir C. Barbosa, “Parallel maximum-flow algorithms on a Transputer hypercube,” Technical Report ES-251/92, Federal University of Rio de Janeiro, Brazil, January 1992.
  93. [pdf] Valmir C. Barbosa, “On the time-driven parallel simulation of two classes of complex systems,” Technical Report ES-248/91, Federal University of Rio de Janeiro, Brazil, December 1991.
  94. [doi] Valmir C. Barbosa and Luís Alfredo V. de Carvalho, “Learning in analog Hopfield networks,” Proceedings of the International Joint Conference on Neural Networks, II-183–186, 1991.
  95. [pdf] Lélio de P. Sá Freitas and Valmir C. Barbosa, “Experiments in parallel heuristic search (extended abstract),” Proceedings of the International Conference on Parallel Processing, III-62–65, 1991.
  96. [doi] Valmir C. Barbosa, Lúcia Maria de A. Drummond, and Astrid Luise H. Hellmuth, “An integrated software environment for large-scale Occam programming,” Proceedings of Euromicro'91, 393–400, 1991.
  97. [doi] Edil S. T. Fernandes, Valmir C. Barbosa, Alberto F. de Souza, and Nelson Q. Vasconcelos, “Micro-instruction placement by simulated annealing,” Proceedings of Euromicro'91, 23–28, 1991.
  98. [doi] Valmir C. Barbosa and Priscila M. V. Lima, “On the distributed parallel simulation of Hopfield's neural networks,” Software: Practice and Experience 20 (1990), 967–983.
  99. [doi] Valmir C. Barbosa, “Strategies for the prevention of communication deadlocks in distributed parallel programs,” IEEE Transactions on Software Engineering 16 (1990), 1311–1316.
  100. [doi] Valmir C. Barbosa, “Blocking versus nonblocking interprocess communication: a note on the effect on concurrency,” Information Processing Letters 36 (1990), 171–175.
  101. [doi] Valmir C. Barbosa and Luís Alfredo V. de Carvalho, “Feasible directions linear programming by neural networks,” Proceedings of the International Joint Conference on Neural Networks, III-941–946, 1990.
  102. [pdf] Luís Alfredo V. de Carvalho and Valmir C. Barbosa, “A TSP objective function that ensures feasibility at stable points,” Proceedings of the International Neural Network Conference, v. 1, 249–253, 1990.
  103. [doi] Valmir C. Barbosa and Maria Cristina S. Boeres, “An Occam-based evaluation of a parallel version of simulated annealing,” Proceedings of Euromicro'90, 85–92, 1990.
  104. [doi] Valmir C. Barbosa and Eli Gafni, “A distributed implementation of simulated annealing,” Journal of Parallel and Distributed Computing 6 (1989), 411–434.
  105. [doi] [acm] Valmir C. Barbosa and Eli Gafni, “Concurrency in heavily loaded neighborhord-constrained systems,” ACM Transactions on Programming Languages and Systems 11 (1989), 562–584.
  106. [pdf] Luís Alfredo V. de Carvalho and Valmir C. Barbosa, “Towards a stochastic neural model for combinatorial optimization,” Technical Report ES-196/89, Federal University of Rio de Janeiro, Brazil, June 1989.
  107. [doi] Edil S. T. Fernandes, Cláudio L. de Amorim, Valmir C. Barbosa, Felipe M. G. França, and Alberto F. de Souza, “MPH—a hybrid parallel machine,” Microprocessing and Microprogramming 25 (1989), 229–232.
  108. [doi] Valmir C. Barbosa and Felipe M. G. França, “Specification of a communication virtual processor for parallel processing systems,” Proceedings of Euromicro'88, 511–518, 1988.
  109. [pdf] Valmir C. Barbosa and Hung K. Huang, “Static task allocation in heterogeneous distributed systems,” Technical Report ES-149/88, Federal University of Rio de Janeiro, Brazil, June 1988.
  110. [pdf] Valmir C. Barbosa and Eli Gafni, “Concurrency in heavily loaded neighborhood-constrained systems,” Proceedings of the International Conference on Distributed Computing Systems, 448–455, 1987.
  111. [pdf] Eli Gafni and Valmir C. Barbosa, “Optimal snapshots and the maximum flow in precedence graphs,” Proceedings of the Annual Allerton Conference on Communication, Control, and Computing, 1089–1097, 1986.

June 14, 2013
Home