Showing papers by "Iouliia Skliarova published in 2002"
17 Jun 2002
TL;DR: An FPGA-based solution, which integrates a specialized virtual controller implementing hierarchical control algorithms and a hardware realization of genetic algorithm for the TSP is proposed.
Abstract: In this paper an adaptive distribution system for manufacturing applications is considered and examined. The system receives a set of various components at a source point and supplies these components to destination points. The objective is to minimize the total distance that has to be traveled. At each destination point some control algorithms have to be activated and each segment of motion between destination points has also to be controlled. The paper suggests a model for such a distribution system based on autonomous subalgorithms that can further be linked hierarchically. The links are set up during execution time (during motion) with the aid of the results obtained from solving the respective traveling salesman problem (TSP) that gives a proper tour of minimal length. The paper proposes an FPGA-based solution, which integrates a specialized virtual controller implementing hierarchical control algorithms and a hardware realization of genetic algorithm for the TSP.
19 citations
04 Mar 2002
TL;DR: A novel approach for solving the Boolean satisfiability problem by combining software and reconfigurable hardware is proposed, which avoids instance-specific hardware compilation and achieves a higher performance than pure software approaches.
Abstract: Summary form only given. In this paper we propose a novel approach for solving the Boolean satisfiability problem by combining software and reconfigurable hardware. The suggested technique avoids instance-specific hardware compilation and, as a result, achieves a higher performance than pure software approaches. Moreover, it permits problems that exceed the resources of the available reconfigurable hardware to be solved.
14 citations
01 Jan 2002
TL;DR: In this article, a possibilidade de aceleracao de AE for o caseo do problema do caixeiro viajante (TSP) com a ajuda de hardware reconfiguravel.
Abstract: *Trabalho financiado com a bolsa da FCT-PRAXIS XXI/BD/21353/99 Resumo – Os algoritmos evolutivos (AE) revelaram-se uma abordagem efectiva no encontro de solucoes sub-optimas para os problemas de optimizacao combinatoria. Este artigo analiza a possibilidade de aceleracao de AE para o caso do problema do caixeiro viajante (TSP) com a ajuda de hardware reconfiguravel. Os resultados estimativos mostram que a combinacao dum computador de uso geral e dos recursos duma FPGA permite incrementar significativamente o desempenho.
1 citations
01 Jan 2002
TL;DR: The detailed description of the Boolean satisfiability (SAT) problem is presented and the complete discrete algorithms that are commonly employed in its solution are considered.
Abstract: This paper presents the detailed description of the Boolean satisfiability (SAT) problem and considers the complete discrete algorithms that are commonly employed in its solution. It is demonstrated that SAT has numerous practical applications. Thus the design and implementation of efficient algorithms is of great importance today. Finally, various realizations of SAT solvers based on reconfigurable hardware are analyzed and compared.