Author of the publication

Solving SAT Problems with TA Algorithms Using Constant and Dynamic Markov Chains Length.

, , and . AAIM, volume 3521 of Lecture Notes in Computer Science, page 281-290. Springer, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Methodology to Parallel the Temperature Cycle in Simulated Annealing., and . MICAI, volume 1793 of Lecture Notes in Computer Science, page 63-74. Springer, (2000)Generator of Synthetic Rainfall Time Series through Markov Hidden States., and . ICCSA (2), volume 5073 of Lecture Notes in Computer Science, page 959-969. Springer, (2008)A Method to Establish the Cooling Scheme in Simulated Annealing Like Algorithms., and . ICCSA (3), volume 3045 of Lecture Notes in Computer Science, page 755-763. Springer, (2004)MPSA: A Methodology to Parallelize Simulated Annealing and Its Application to the Traveling Salesman Problem., and . MICAI, volume 2313 of Lecture Notes in Computer Science, page 89-97. Springer, (2002)Solving SAT Problems with TA Algorithms Using Constant and Dynamic Markov Chains Length., , and . AAIM, volume 3521 of Lecture Notes in Computer Science, page 281-290. Springer, (2005)ANDYMARK: An Analytical Method to Establish Dynamically the Length of the Markov Chain in Simulated Annealing for the Satisfiability Problem., , and . SEAL, volume 4247 of Lecture Notes in Computer Science, page 269-276. Springer, (2006)