Generating incrmental VLSI compaction spacing constraints with adjacency lists.

Download
023352.pdf
1992
Peker, Deha
Show full item record
164
views
0
downloads
https://hdl.handle.net/11511/12044
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

Generating all efficient solutions of a rescheduling problem on unrelated parallel machines
Ozlen, Melih; Azizoğlu, Meral (Informa UK Limited, 2009-01-01)
In this paper, we consider a rescheduling problem where a set of jobs has already been assigned to unrelated parallel machines. When a disruption occurs on one of the machines, the affected jobs are rescheduled, considering the efficiency and stability measures. Our efficiency measure is the total flow time and stability measure is the total reassignment cost caused by the differences in the machine allocations in the initial and new schedules. We propose a branch and bound algorithm to generate all efficie...
Generating representative nondominated point subsets in multi-objective integer programs
Ceyhan, Gökhan; Köksalan, Murat; Lokman, Banu; Department of Industrial Engineering (2014)
In this thesis, we study generating a subset of all nondominated points of multi-objective integer programs in order to represent the nondominated frontier. Our motivation is based on the fact that generating all nondominated points of a multi-objective integer program is neither practical nor useful. The computational burden could be prohibitive and the resulting set could be huge. Instead of finding all nondominated points, we develop algorithms to generate a small representative subset of nondominated po...
GENERATING EFFECTIVE INITIATION SETS FOR SUBGOAL-DRIVEN OPTIONS
DEMİR, ALPER; Cilden, Erkin; Polat, Faruk (World Scientific Pub Co Pte Lt, 2019-03-01)
Options framework is one of the prominent models serving as a basis to improve learning speed by means of temporal abstractions. An option is mainly composed of three elements: initiation set, option's local policy and termination condition. Although various attempts exist that focus on how to derive high-quality termination conditions for a given problem, the impact of initiation set generation is relatively unexplored. In this work, we propose an effective goal-oriented heuristic method to derive useful i...
Generating positive bounding boxes for balanced training of object detectors
Oksuz, Kemal; Cam, Baris Can; Akbaş, Emre; Kalkan, Sinan (2020-03-01)
© 2020 IEEE.Two-stage deep object detectors generate a set of regions-of-interest (RoIs) in the first stage, then, in the second stage, identify objects among the proposed RoIs that sufficiently overlap with a ground truth (GT) box. The second stage is known to suffer from a bias towards RoIs that have low intersection-over-union (IoU) with the associated GT boxes. To address this issue, we first propose a sampling method to generate bounding boxes (BB) that overlap with a given reference box more than a gi...
Generating various types of graphical models viaMARS
Ayyıldız, Ezgi; Purutçuoğlu Gazi, Vilda (null; 2016-05-21)
Citation Formats
D. Peker, “Generating incrmental VLSI compaction spacing constraints with adjacency lists.,” Middle East Technical University, 1992.
METU IIS - Integrated Information Service open@metu.edu.tr