The first step of the Adleman-Lipton extract model in DNA computing is the combinatorial generation of libraries. In this paper a new method is proposed for generating a initial p...
Abstract. This paper proposes an algorithm for combinatorial optimizations that uses reinforcement learning and estimation of joint probability distribution of promising solutions ...
Appeared in: N.V. Murray, editor, Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX’99), Lecture Notes in Artificial Intelligence 1617, Springer, pages 2...
Two novel suboptimal algorithms for mutual exclusion in distributed systems are presented. One is based on the modi cation of Maekawa's grid based quorum scheme. The size of ...
Abstract. The typical use of force-directed layout is to create organiclooking, straight-edge drawings of large graphs while combinatorial techniques are generally preferred for hi...