{ a e t p i e k a r s k i , m a u r o m , t o n y . h i l d , m h m u l a t i } @ g m a i l . c o m , d k i k u t i @ d i n . u e m . b r Abstract. This paper describes the experience of an extension project for the training in computer programming, using the methodology of programming contest and aiming at the selection of teams to participate in the First Phase of the SBC Programming Contest. In addition to describing the carried out activities and present some project results, this paper aims to share the adopted methodology, in order to discuss possibilities and strategies for future activities.Resumo. Este artigo descreve a experiência de um projeto de extensão destinado ao treinamento em programação de computadores, utilizando a metodologia das maratonas de programação e visando a seleção de times para participação na Primeira Fase da Maratona de Programação da SBC. Além de descrever as atividades realizadas e apresentar alguns resultados do projeto, o artigo visa compartilhar a metodologia adotada, a fim de discutir possibilidades e estratégias para atividades futuras.

This paper proposes the algorithm based on the metaheuristic Ant Colony Optimization (ACO) called Ant-Line, which uses the line-oriented approach for the set covering problem, that is an innovative and emerging approach in the context, beyond the use of a local search. The algorithm is compared with other ACO-based approaches. The results obtained are promising and have reached good quality of solution and running time.

No abstract

No abstract

No abstract