<?xml version="1.0" encoding="UTF-8"?>
<record>
  <title>The Las Vegas Method of Parallelization</title>
  <journal>Progress in Signals and Telecommunication Engineering</journal>
  <author>Bogdan Zavalnij</author>
  <volume>8</volume>
  <issue>2</issue>
  <year>2019</year>
  <doi></doi>
  <url>http://www.dline.info/pste/fulltext/v8n2/pstev8n2_3.pdf</url>
  <abstract>While the methods of parallelizing Monte Carlo algorithms in engineering modeling very popular, these methods
are of little use in discrete optimization problems. We propose that the variance of the Monte Carlo method, the Las Vegas
method can be used for these problems. We would like to outline the basic concept and present the algorithm working on a
specific problem of finding the maximum clique.</abstract>
</record>
