Nowadays, One-Dimensional Cutting Stock Problem (1D-CSP) is used in many industrial processes and re-cently has been considered as one of the most important research topic. In this paper, a metaheuristic algo-rithm based on the Simulated Annealing (SA) method is represented to minimize the trim loss and also to fo-cus the trim loss on the minimum number of large objects. In this method, the 1D-...

Adaptive interaction is a new approach to introduce adaptability into man made systems In this approach a system is decomposed into interconnected subsystems that we call devices and adaptation occurs in the interactions More precisely interac tion weights among these devices will be adapted in order to achieve the objective of minimizing a given cost function The adaptation algorithm developed...

We present a new method for estimating the expected return of a POMDP from experi­ ence. The estimator does not assume any knowledge of the POMDP, can estimate the returns for finite state controllers, allows ex­ perience to be gathered from arbitrary se­ quences of policies, and estimates the return for any new policy. We motivate the estima­ tor from function-approximation and impor­ tance sa...

This paper addresses a shortcoming of the widely used Generalized Processor Sharing (GPS) scheduling a1 U rithm which can have significant impact on the pmviied service, however; which has been given little attention. Since, with GPS, the service rate received by a session is proportional to the number of backlogged sessions in the system, the service rate of a session may change abruptly if so...

This paper presents an algorithm for distributed garbage collection and outlines its implementation within the Network Objects system The algorithm is based on a reference listing scheme which is augmented by partial tracing in order to collect distributed garbage cy cles Processes may be dynamically organised into groups according to appropriate heuristics to reclaim distributed garbage cycles...

In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A in R^{ntimes n}$ , $C in R^{ntimes n}$ , $B in R^{stimes s}$ and  $D in R^{stimes s}$ are given matrices and $X in R^{stimes s}$  is the unknown matrix. We present a global conjugate gradient (GL-CG) algo- rithm for solving linear system of equations with multiple right-han...

In this paper we present a.n efficient pa.ra.Ilel algorithm. for polygon tria.ngu.Ia.tion. The algo-rithm we present runs in O(logn) time using D(n) processors, which is optimal if the polygon is allowed to contain holes. This improves the previous parallel complexity bounds for this problem by a log n factor. If we are also given a trapezoidal decomposition of the polygon as input, then we can...

We explore the issue of re ning an exis tent Bayesian network structure using new data which might mention only a subset of the variables Most previous works have only considered the re nement of the net work s conditional probability parameters and have not addressed the issue of re n ing the network s structure We develop a new approach for re ning the network s structure Our approach is base...

Abstmct Handover in heterogeneous cellular networks is one of the hottest topics for the wireless networks beyond the third generation. This paper presents a new downlink soft handover algorithm to solve the serious “power exhausting” problem during the traditional handover process in heterogeneous cellular systems. The power exhausting problem occurs when in the traditional handover process, t...

Modern composite scientific applications, also called scientific work‐ flows, require large processing capacities. Cloud environments provide high performance and flexible infrastructure, which can be easily employed for work‐ flows execution. Since cloud resources are paid in the most cases, there is a need to utilize these resources with maximal efficiency. In this paper we propose dynamic re...