Now showing items 1-4 of 4

    • Ant colony optimization for the single model U-type assembly line balancing problem 

      Sabuncuoglu, I.; Erel, E.; Alp, A. (Elsevier, 2009)
      An assembly line is a production line in which units move continuously through a sequence of stations. The assembly line balancing problem is defined as the allocation of tasks to an ordered sequence of stations subject ...
    • The COST292 experimental framework for TRECVID 2007 

      Zhang, Q.; Corvaglia, M.; Aksoy, S.; Naci, U.; Adami, N.; Aginako, N.; Alatan, A.; Alexandre, L. A.; Almeida, P.; Avrithis, Y.; Benois-Pineau, J.; Chandramouli, K.; Damnjanovic, U.; Esen, E.; Goya, J.; Grzegorzek, M.; Hanjalic, A.; Izquierdo, E.; Jarina, R.; Kapsalas, P.; Kompatsiaris, I.; Kuba, M.; Leonardi, R.; Makris, L.; Mansencal, B.; Mezaris, V.; Moumtzidou, A.; Mylonas, P.; Nikolopoulos, S.; Piatrik, T.; Pinheiro, A. M. G.; Reljin, B.; Spyrou, E.; Tolias, G.; Vrochidis, S.; Yakın, G.; Zajic, G. (National Institute of Standards and Technology, 2007)
      In this paper, we give an overview of the four tasks submitted to TRECVID 2007 by COST292. In shot boundary (SB) detection task, four SB detectors have been developed and the results are merged using two merging algorithms. ...
    • 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 ...
    • Foraging swarms as Nash equilibria of dynamic games 

      Özgüler, A. B.; Yildiz, A. (IEEE, 2014)
      The question of whether foraging swarms can form as a result of a noncooperative game played by individuals is shown here to have an affirmative answer. A dynamic game played by N agents in 1-D motion is introduced and ...