4 resultados para all substring common subsequence problem
em Digital Peer Publishing
Resumo:
Speaking about professionals, working with children at child care homes in Lithuania, first of all we encounter a problem of terminology. This problem rises, because in various countries and languages we call these professionals differently. In Lithuania we call them ”aukletojai”. We also use the word ”aukletojas” when speaking about both professionals, working directly with children at kindergartens, and parents, as all parents are educators of their children. We suppose, that the word ”aukletojas” corresponds to the German “erzieher”, and “aukleti” to “erziehen”. Every “aukletojas” in Lithuania clearly realizes, that he is a pedagogue, because in this country every professional, involved in educational work with children – an ”aukletojas”, a teacher, a social pedagogue and a special pedagogue – is called a pedagogue. In this context it is essential to conceive that in Lithuania an ”educator” and a ”social pedagogue” are different pedagogical professions and that none of the ”aukletojas” identify himself as a social pedagogue.
Resumo:
In this paper we propose two cooperation schemes to compose new parallel variants of the Variable Neighborhood Search (VNS). On the one hand, a coarse-grained cooperation scheme is introduced which is well suited for being enhanced with a solution warehouse to store and manage the so far best found solutions and a self-adapting mechanism for the most important search parameters. This makes an a priori parameter tuning obsolete. On the other hand, a fine-grained scheme was designed to reproduce the successful properties of the sequential VNS. In combination with the use of parallel exploration threads all of the best solutions and 11 out of 20 new best solutions for the Multi Depot Vehicle Routing Problem with Time Windows were found.
Resumo:
In manual order picking systems, order pickers walk or drive through a distribution warehouse in order to collect items which are requested by (internal or external) customers. In order to perform these operations efficiently, it is usually required that customer orders are combined into (more substantial) picking orders of limited size. The Order Batching Problem considered in this paper deals with the question of how a given set of customer orders should be combined such that the total length of all tours is minimized which are necessary to collect all items. The authors introduce two metaheuristic approaches for the solution of this problem: the first one is based on Iterated Local Search; the second on Ant Colony Optimization. In a series of extensive numerical experiments, the newly developed approaches are benchmarked against classic solution methods. It is demonstrated that the proposed methods are not only superior to existing methods but provide solutions which may allow distribution warehouses to be operated significantly more efficiently.
Resumo:
Exposure Fusion and other HDR techniques generate well-exposed images from a bracketed image sequence while reproducing a large dynamic range that far exceeds the dynamic range of a single exposure. Common to all these techniques is the problem that the smallest movements in the captured images generate artefacts (ghosting) that dramatically affect the quality of the final images. This limits the use of HDR and Exposure Fusion techniques because common scenes of interest are usually dynamic. We present a method that adapts Exposure Fusion, as well as standard HDR techniques, to allow for dynamic scene without introducing artefacts. Our method detects clusters of moving pixels within a bracketed exposure sequence with simple binary operations. We show that the proposed technique is able to deal with a large amount of movement in the scene and different movement configurations. The result is a ghost-free and highly detailed exposure fused image at a low computational cost.