Now showing items 1-16 of 16

    • Application mapping algorithms for mesh-based network-on-chip architectures 

      Tosun, S.; Ozturk, O.; Ozkan, E.; Ozen, M. (Springer New York LLC, 2015-03)
      Due to shrinking technology sizes, more and more processing elements and memory blocks are being integrated on a single die. However, traditional communication infrastructures (e.g., bus or point-to-point) cannot handle ...
    • Assembly line balancing using genetic algorithms 

      Sabuncuoğlu İ.; Erel, E.; Tanyer, M. (Kluwer Academic Publishers, 2000)
      Assembly Line Balancing (ALB) is one of the important problems of production/operations management area. As small improvements in the performance of the system can lead to significant monetary consequences, it is of utmost ...
    • Balancing of U-type assembly systems using simulated annealing 

      Erel, E.; Sabuncuoğlu İ.; Aksu, B. A. (Taylor & Francis, 2001)
      The paper presents a new simulated annealing (SA)-based algorithm for the assembly line-balancing problem with a U-type con®guration. The proposed algorithm employs an intelligent mechanism to search a large solution space. ...
    • Computer aided frequency planning for the radio and TV broadcasts 

      Altıntaş, A.; Ocalı, O.; Topçu, S.; Tanyer, S. G.; Köymen, H. (Institute of Electrical and Electronics Engineers, 1996-06)
      The frequency planning of the VHF and UHF broadcasts in Turkey is described. This planning is done with the aid of computer databases and digital terrain map. The frequency offset is applied whenever applicable to increase ...
    • Customer order scheduling problem: a comparative metaheuristics study 

      Hazır, Ö.; Günalay, Y.; Erel, E. (Springer, 2007)
      The customer order scheduling problem (COSP) is defined as to determine the sequence of tasks to satisfy the demand of customers who order several types of products produced on a single machine. A setup is required whenever ...
    • Design of trellis waveform coders with near-optimum structure 

      Kuruoglu, E.E.; Ayanoglu, E. (IET, 1992)
      In this Letter the combinatorial optimisation algorithm known as simulated annealing is used for the optimisation of the trellis structure of the next-state map of the decoder finite-state machine in trellis waveform coding. ...
    • Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems 

      Ghaffarinasab, N.; Motallebzadeh, A.; Jabarzadeh, Y.; Kara, B. Y. (Elsevier, 2018)
      Hub location problems (HLPs) constitute an important class of problems in logistics with numerous applications in passenger/cargo transportation, postal services, telecommunications, etc. This paper addresses the competitive ...
    • Examining the annealing schedules for RNA design algorithm 

      Erhan, H. E.; Sav, S.; Kalashnikov, S.; Tsang, H. H. (Institute of Electrical and Electronics Engineers, 2016)
      RNA structures are important for many biological processes in the cell. One important function of RNA are as catalytic elements. Ribozymes are RNA sequences that fold to form active structures that catalyze important ...
    • Fault-tolerant topology generation method for application-specific network-on-chips 

      Tosun, S.; Ajabshir, V. B.; Mercanoglu, O.; Ozturk, O. (Institute of Electrical and Electronics Engineers, 2015)
      As the technology sizes of integrated circuits (ICs) scale down rapidly, current transistor densities on chips dramatically increase. While nanometer feature sizes allow denser chip designs in each technology generation, ...
    • Generating short-term observation schedules for space mission projects 

      Aktürk, M. S.; Kılıç, K. (Kluwer Academic Publishers, 1999)
      In this paper, we propose a new dispatching rule and a set of local search algorithms based on the filtered beam search, GRASP and simulated annealing methodologies to construct short-term observation schedules of space ...
    • A local search heuristic with self-tuning parameter for permutation flow-shop scheduling problem 

      Dengiza, B.; Uslub, C.A.; Sabuncuogluc I. (2009)
      In this paper, a new local search metaheuristic is proposed for the permutation flow-shop scheduling problem. In general, metaheuristics are widely used to solve this problem due to its NP-completeness. Although these ...
    • New heuristic for the dynamic layout problem 

      Erel, E.; Ghosh, J. B.; Simon, J. T. (Palgrave Macmillan, 2003)
      The dynamic layout problem addresses the situation where the traffic among the various units within a facility changes over time. Its objective is to determine a layout for each period in a planning horizon such that the ...
    • Robot move sequence determining and multiple part-type scheduling in hybrid flexible flow shop robotic cells 

      Batur, G. D.; Erol, S.; Karasan, O. E. (Elsevier, 2016)
      We focus on the scheduling problem arising in hybrid flexible flow shops which repeatedly produce a set of multiple part-types and where the transportation of the parts between the machines is performed by a robot. The ...
    • SIMARD: a simulated annealing based RNA design algorithm with quality pre-selection strategies 

      Sav, S.; Hampson, D. J. D.; Tsang, H. H. (Institute of Electrical and Electronics Engineers Inc., 2017)
      Most of the biological processes including expression levels of genes and translation of DNA to produce proteins within cells depend on RNA sequences, and the structure of the RNA plays vital role for its function. RNA ...
    • Simulated annealing for texture segmentation with Markov models 

      Yalabik, M. C.; Yalabik, N. (Publ by IEEE, Piscataway, NJ, United States, 1989)
      Binary textured images are segmented into regions of different textures. The binary Markov model is used, and model parameters are assumed to be unknown prior to segmentation. The parameters are estimated using a ...
    • Three-dimensional monochromatic light field synthesis with a deflectable mirror array device 

      Ulusoy, E.; Uzunov V.; Onural L.; Ozaktas, H., M.; Gotchev, A. (2006)
      We investigated the problem of complex scalar monochromatic light field synthesis with a deflectable mirror array device (DMAD). First, an analysis of the diffraction field produced by the device upon certain configurations ...