The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Most products and manufacturing systems (MS) have an inherent hierarchical structure. They are composed of multiple subsystems, such as machines, process components, or resources. In order to optimize the control parameters of such systems, manufacturing planners often follow a global black-box approach. The optimization, thus, neglects the hierarchical structure encoded in the model. All subsystems...
This paper considers distributed protocol design for joint sub-carrier, transmission scheduling and power management in uplink/downlink multi-cellular OFDMA wireless networks. The optimal solution to this problem is hard to achieve, both in theory and in practice. We propose a fully decentralized resource allocation scheme combining decomposition methods for convex optimization with a strategic non-cooperative...
Uplink resource allocation in OFDMA cellular networks enhanced with two-hop fixed relays is studied in this paper. A resource optimization problem that maximizes sum uplink throughput of all users is formulated under path selection and PHY/MAC constraints. The dual decomposition method is adopted to solve the problem efficiently and optimally. Dual problem of the primal problem is decoupled into N...
We propose iSVM - an incremental algorithm that achieves high speed in training support vector machines (SVMs) on large datasets. In the common decomposition framework, iSVM starts with a minimum working set (WS), and then iteratively selects one training example to update the WS in each optimization loop. iSVM employs a two-stage strategy in processing the training data. In the first stage, the most...
In this paper, we propose a general decomposition and coordination method for timed Petri nets to determine an optimal transition firing sequence to minimize an objective function. A timed Petri net model for multiple entities is decomposed into several subnets in which the optimal firing sequence for each subnet is easily solved in polynomial computational complexity. The solution of each subproblem...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.