نتایج جستجو برای: ordering optimization problem
تعداد نتایج: 1130445 فیلتر نتایج به سال:
in this paper, according to high load capacity and rather large workspace characteristics of cable driven robots (cdrs), maximum dynamic load carrying capacity (dlcc) between two given end points in the workspace along with optimal trajectory is obtained. in order to find dlcc of cdrs, joint actuator torque and workspace of the robot constraints concerning to non-negative tension in cables are ...
In this article a special case of the class-teacher timetabling problem is described. This case takes into consideration a partial ordering between the topics of the curriculum and special requirements in respect to their daily lectures. The problem is modelled as a discrete lexicographic optimization problem. A heuristic procedure for solving the problem is developed. The method represents a c...
This paper deals with the problem of computing the boundary of the capacity region for the memoryless two-user binary-input binary-output multiple-access channel ((2, 2; 2)MAC), or equivalently, the computation of input probability distributions maximizing weighted sum-rate. This is equivalent to solving a difficult nonconvex optimization problem. For a restricted class of (2, 2; 2)-MACs and we...
In a constraint optimization problem (COP), many feasible valuations lead to the same objective value. This often means a huge search space and poor performance in the propagation between the objective and problem variables. In this paper, we propose a different modeling and search strategy which focuses on the cost function. We show that by constructing a dual model on the objective variables,...
Insurance-linked securities portfolio with the VaR constraint optimization problem have a kind of weak dominance or ordering property, which enables us to reduce the variables’ dimensions gradually through exercising a genetic algorithm with randomly selected initial populations. This property also enables us to add boundary attraction potential to GA-MPC’s repair operator, among other modifica...
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fundamental to understand nature and complexity of optimization problems over permutations (e.g., ordering, scheduling, traveling salesman problem). The description is based on permutation neighborhoods of several kinds (...
Join ordering is the problem of finding cost optimal execution plans for matching multi-headed rules. In the context of Constraint Handling Rules, this topic has received limited attention so far, even though it is of great importance for efficient CHR execution. We present a formal cost model for joins and investigate the possibility of join optimization at runtime. We propose some heuristic a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید