Yayıncı

Toplam kayıt 28, listelenen: 1-20

    • A DE based variable iterated greedy algorithm for the no-idle permutation flowshop scheduling problem with total flowtime criterion 

      Tasgetiren, M.F.; Pan, Q.K.; Wang, L.; Chen, A.H.L. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011)
      In this paper, we present a variable iterated greedy (vIGP-DE) algorithm where its parameters (basically destruction size and cooling parameter for the simulated annealing type of acceptance criterion) are optimized by the ...

    • A differential evolution algorithm for the extraction of complex natural resonance frequencies of electromagnetic targets 

      Secmen, M.; Tasgetiren, M.F. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011)
      This paper presents a differential evolution algorithm in order to find unique resonance frequencies of an electromagnetic target in the resonance scattering region. These frequencies are estimated from the roots of Laplace ...

    • A dynamic berth allocation problem with priority considerations under stochastic nature 

      Guldogan, E.U.; Bulut, O.; Tasgetiren, M.F. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011)
      Stochastic nature of vessel arrivals and handling times adds to the complexity of the well-known NP-hard berth allocation problem. To aid real decision-making under customer differentiations, a dynamic stochastic model ...

    • A general variable neighborhood search algorithm for the no-idle permutation flowshop scheduling problem 

      Tasgetiren, M.F.; Buyukdagli, O.; Pan, Q.K.; Suganthan, P.N. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013)
      In this study, a general variable neighborhood search (GVNS) is presented to solve no-idle permutation flowshop scheduling problem (NIPFS), where idle times are not allowed on machines. GVNS is a metaheuristic, where inner ...

    • A genetic algorithm for the economic lot scheduling problem under extended basic period approach and power-of-two policy 

      Bulut, O.; Tasgetiren, M.F.; Fadiloglu, M.M. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011)
      In this study, we propose a genetic algorithm (GA) for the economic lot scheduling problem (ELSP) under extended basic period (EBP) approach and power-of-two (PoT) policy. The proposed GA employs a multi-chromosome solution ...

    • A novel mobile epilepsy warning system 

      Alkan, A.; Sahin, Y.G.; Karlik, B. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2006)
      This paper presents a new design of mobile epilepsy warning system for medical application in telemedical environment. Mobile Epilepsy Warning System (MEWS) consists of a wig with a cap equipped with sensors to get ...

    • A pattern mining approach in feature extraction for emotion recognition from speech 

      Avci, U.; Akkurt, G.; Unay, D. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2019)
      We address the problem of recognizing emotions from speech using features derived from emotional patterns. Because much work in the field focuses on using low-level acoustic features, we explicitly study whether high-level ...

    • A populated iterated greedy algorithm with inver-over operator for traveling salesman problem 

      Tasgetiren, M.F.; Buyukdagli, O.; Kizilay, D.; Karabulut, K. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013)
      In this study, we propose a populated iterated greedy algorithm with an Inver-Over operator to solve the traveling salesman problem. The iterated greedy (IG) algorithm is mainly based on the central procedures of destruction ...

    • A simple and compact algorithm for sidh with arbitrary degree isogenies 

      Costello, C.; Hisil, H. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2017)
      We derive a new formula for computing arbitrary odd-degree isogenies between elliptic curves in Montgomery form. The formula lends itself to a simple and compact algorithm that can efficiently compute any low odd-degree ...

    • A variable iterated greedy algorithm with differential evolution for solving no-idle flowshops 

      Tasgetiren, M.F.; Pan, Q.K.; Suganthan, P.N.; Buyukdagli, O. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012)
      In this paper, we present a variable iterated greedy algorithm where its parameters (basically destruction size and probability of whether or not to apply the iterated greedy algorithm to an individual) are optimized by ...

    • Authenticated Quality of Service Aware Routing in Software Defined Networks 

      Aytac, S.; Ermis, O.; Caglayan, M.U.; Alagoz, F. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2019)
      Quality of Service (QoS) aware routing is an ongoing and major problem for traditional networks since they are not able to manage network traffic for immense variety of users due to their inflexible and static architectures. ...

    • Constraint and mathematical programming models for integrated port container terminal operations 

      Kizilay, D.; Tursel Eliiyi, D.; Van Hentenryck, P. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018)
      This paper considers the integrated problem of quay crane assignment, quay crane scheduling, yard location assignment, and vehicle dispatching operations at a container terminal. The main objective is to minimize vessel ...

    • Control network programming with SPIDER: Dynamic search control 

      Kratchanov, K.; Golemanov, T.; Golemanova, E.; Ercan, T. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2010)
      The report describes the means for dynamic control of the computation process that are available in Spider - a language for Control Network Programming. © 2010 Springer-Verlag.

    • Convergence detection in epidemic aggregation 

      Poonpakdee, P.; Orhon, N.G.; Di Fatta, G. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014)
      Emerging challenges in ubiquitous networks and computing include The ability To extract useful information from a vast amount of data which are intrinsically distributed. Epidemic protocols are a bio-inspired approach That ...

    • d-MUL: Optimizing and implementing a multidimensional scalar multiplication algorithm over elliptic curves 

      Hisil, H.; Hutchinson, A.; Karabina, K. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018)
      This paper aims to answer whether d-MUL, the multidimensional scalar point multiplication algorithm, can be implemented efficiently. d-MUL is known to access costly matrix operations and requires memory access frequently. ...

    • Energy-efficient single machine total weighted tardiness problem with sequence-dependent setup times 

      Tasgetiren, M.F.; Oztop, H.F.; Eliiyi, U.; Tursel Eliiyi, D.; Pan, Q.K. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018)
      Most of the problems defined in the scheduling literature do not yet take into account the energy consumption of manufacturing processes, as in most of the variants with tardiness objectives. This study handles scheduling ...

    • Exploring topology preservation of SOMs with a graph based visualization 

      Tasdemir, K. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2008)
      The Self-Organizing Map (SOM), which projects a (high-dimensional) data manifold onto a lower-dimensional (usually 2-d) rigid lattice, is a commonly used manifold learning algorithm. However, a postprocessing - that is ...

    • Fast cryptography in genus 2 

      Bos, J.W.; Costello, C.; Hisil, H.; Lauter, K. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013)
      In this paper we highlight the benefits of using genus 2 curves in public-key cryptography. Compared to the standardized genus 1 curves, or elliptic curves, arithmetic on genus 2 curves is typically more involved but allows ...

    • Faster compact Diffie-Hellman: Endomorphisms on the x-line 

      Costello, C.; Hisil, H.; Smith, B. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014)
      We describe an implementation of fast elliptic curve scalar multiplication, optimized for Diffie-Hellman Key Exchange at the 128-bit security level. The algorithms are compact (using only x-coordinates), run in constant ...

    • Green Permutation Flowshop Scheduling: A Trade- off- Between Energy Consumption and Total Flow Time 

      Oztop, H.; Tasgetiren, M.F.; Tursel Eliiyi, D.; Pan, Q.K. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018)
      Permutation flow shop scheduling problem (PFSP) is a well-known problem in the scheduling literature. Even though many multi-objective PFSPs are presented in the literature with the objectives related to production efficiency ...