نتایج جستجو برای: spatial optimization
تعداد نتایج: 671065 فیلتر نتایج به سال:
there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...
in this paper, landscape allocation using genetic algorithm (laga), a spatial multi-objective land use optimization software is introduced. the software helps in searching for optimal land use when multiple objectives such as suitability, area, cohesion and edge density indices are simultaneously involved. laga is a flexible and easy to use genetic algorithm-based software for optimizing the sp...
planning robot trajectory is a complex task that plays a significant role in design and application of robots in task space. the problem is formulated as a trajectory optimization problem which is fundamentally a constrained nonlinear optimization problem. open-loop optimal control method is proposed as an approach for trajectory optimization of cable parallel manipulator for a given two-end-po...
A quick group search optimizer (QGSO) is an intelligent optimization algorithm which has been applied in structural optimal design, including the hinged spatial structural system. The accuracy and convergence rate of QGSO are feasible to deal with a spatial structural system. In this paper, the QGSO algorithm optimization is adopted in seismic research of steel frames with semi-rigid connection...
| Due to the high complexity and large volume of spatial data, a spatial query has been processed in two steps, called the lter step and the reenement step. However, the two-step processing of the spatial query has been considered locally in one spatial predicate evaluation at the query execution level. This paper presents query optimization strategies which exploit the two-step processing of a...
| Due to the high complexity and large volume of spatial data, a spatial query is usually processed in two steps, called the lter step and the re nement step. However, the two-step processing of the spatial query has been considered locally in one spatial predicate evaluation at the query execution level. This paper presents query optimization strategies which exploit the two-step processing of...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید