نتایج جستجو برای: problem solution pattern
تعداد نتایج: 1528976 فیلتر نتایج به سال:
Model-driven engineering and model transformation have gained significant importance in recent years. However, most model transformation developments are handled without quality in mind. This paper presents a new model transformation design pattern which improves quality in model transformation. We discovered the pattern after solving a specific problem with two alternative model transformation...
This paper investigates an approach to the permutation flowshop scheduling problem based on Tabu Search with an additional memory structure called a ‘pruning pattern list’. The pruning pattern list approach allows a better use of the critical block information. A solution of the flowshop scheduling problem is represented by a permutation of job numbers. A pruning pattern is generated from a sol...
Design patterns are general reusable solutions to a commonly occurring problem in software design. One of the important patterns is Strategy Pattern. The strategy pattern is intended to provide a means to define a family of algorithms, encapsulate each one as an object and make them interchangeable. In this paper, a solution is proposed to improve security in application programs by using the S...
Transportation problems are usually considered in large-scale networks, where finding the optimal solution of these problems is so time-consuming and costly. Therefore, a useful method to solve the large-scale network problems is dividing them into some smaller sub-problems. In this paper, for the first time, the origin-destination (o-d) matrix estimation problem is considered through a mixed p...
We study the problem of parameterized matching in a stream where we want to output matches between a pattern of length m and the last m symbols of the stream before the next symbol arrives. Parameterized matching is a natural generalisation of exact matching where an arbitrary one-to-one relabelling of pattern symbols is allowed. We show how this problem can be solved in constant time per arriv...
Leader election and arbitrary pattern formation are fundammental tasks for a set of autonomous mobile robots. The former consists in distinguishing a unique robot, called the leader. The latter aims in arranging the robots in the plane to form any given pattern. The solvability of both these tasks turns out to be necessary in order to achieve more complex tasks. In this paper, we study the rela...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید