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.
Coarse-grained reconfigurable arrays (CGRAs) are a style of programmable logic device situated between FPGAs and custom ASICs on the spectrum of programmability, performance, power and cost. CGRAs have been proposed by both academia and industry; however, prior works have been mainly self-contained without broad architectural exploration and comparisons with competing CGRAs. We present CGRA-ME - a...
In this paper, we present a standard cell design methodology for Spin Wave Device (SWD) circuits. We perform Place and Route (P&R) experiments against a 10nm FinFET CMOS technology and compare the area, the routing and metal distribution of several arithmetic benchmarks. We show that SWD circuits although they require more metal layers than CMOS designs and although they contain double the number...
In this paper, we investigate the use of the large neighborhood search for solving the pickup and delivery problem with time windows. Such a problem may be viewed as a variant of the capacitated vehicle routing problem with time windows, where both precedence and coupling constraints are considered. The proposed method is based on the framework of the large neighborhood search combined with local...
In this paper we investigate the use of the large neighborhood search for solving the vehicle routing problem with two-dimensional loading constraints, an NP-hard combinatorial optimization problem. Such a problem may be viewed as the combination of two complementary well-known problems: two-dimensional bin-packing and capacitated vehicle routing. The proposed method considers a two-phase solution...
Polarity-controllable transistors have emerged in the last few years as an adequate successor of current CMOS FinFETs. Due to the additional polarity terminal, novel physical design techniques are required. We present a novel grid-based power routing scheme able to mitigate the polarity terminal impact. The logic cells are organized in regular arrangements and easily configured using the novel power...
This paper is concerned with the multiple Traveling Salesman Problem (mTSP) with lower and upper bound constraints on tour durations. The paper presents a flow-based integer linear programming formulation of the problem and some valid inequalities. The paper also describes a Benders decomposition algorithm based on this model as an exact solution approach. Computational experimentation shows that...
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.