327 sonucu aktar:
[ Yazar(Desc)] Başlık Tür Yıl
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
Başoğlu, İ., W. Hörmann, and H. Sak, "Efficient simulations for a Bernoulli mixture model of portfolio credit risk", Annals of Operations Research, vol. 260, pp. 113–128, 2018.
Baydogan, M. Gokce, and G. Runger, "Learning a symbolic representation for multivariate time series classification", Data Mining and Knowledge Discovery, vol. 29, issue 2: Springer US, pp. 400-422, 03/2015.
Baydogan, M. Gokce, and G. Runger, "Time series representation and similarity based on local autopatterns", Data Mining and Knowledge Discovery, vol. 30, issue 2, pp. 476–509, 03/2016.
Baydogan, M. Gokce, and G. Runger, "Time series representation and similarity based on local autopatterns", Data Mining and Knowledge Discovery, vol. 30, pp. 476–509, 2016.
Baydogan, M. Gokce, G. Runger, and E. Tuv, "A Bag-of-Features Framework to Classify Time Series", IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35, pp. 2796-2802, 2013.
Beşikci, U., Ü. Bilge, and G. Ulusoy, Different resource management policies in multi-mode resource constrained multi-project scheduling, : Institute of Electrical and Electronics Engineers, Inc., 2011.
Beşikci, U., Ü. Bilge, and G. Ulusoy, "Resource dedication problem in a multi-project environment", Flexible Services and Manufacturing Journal, vol. 25, no. 1-2: Springer, pp. 206–229, 2013.
Bilge, Ü., G. Esenduran, N. Varol, Z. Öztürk, B. Aydın, and A. Alp, "Multi-attribute responsive dispatching strategies for automated guided vehicles", International Journal of Production Economics, vol. 100, no. 1: Elsevier, pp. 65–75, 2006.
Bilge, Ü., and G. Ulusoy, "A time window approach to simultaneous scheduling of machines and material handling system in an FMS", Operations Research, vol. 43, no. 6: INFORMS, pp. 1058–1070, 1995.
Bilge, Ü., M. Fırat, and E. Albey, "A parametric fuzzy logic approach to dynamic part routing under full routing flexibility", Computers & Industrial Engineering, vol. 55, no. 1: Elsevier, pp. 15–33, 2008.
Bilge, Ü., F. Kıraç, M. Kurtulan, and P. Pekgün, "A tabu search algorithm for parallel machine total tardiness problem", Computers & Operations Research, vol. 31, no. 3: Elsevier, pp. 397–414, 2004.
Bilge, Ü., E. Albey, U. Beşikci, K. Erbatur, and A. Nur Aslan, "Mathematical models for FMS loading and part type selection with flexible process plans", European Journal of Industrial Engineering: Inderscience, 2013.
Bilge, Ü., M. Kurtulan, and F. Kıraç, "A tabu search algorithm for the single machine total weighted tardiness problem", European Journal of Operational Research, vol. 176, no. 3: Elsevier, pp. 1423–1435, 2007.
Bilge, Ü., and JMA. Tanchoco, "AGV systems with multi-load carriers: basic issues and potential benefits", Journal of manufacturing systems, vol. 16, no. 3: Elsevier, pp. 159–174, 1997.
Bilgiç, T., "The Membership Function and Its Measurement", On Fuzziness: Springer Berlin Heidelberg, pp. 47–53, 2013.
Bilgiç, T., and R. Güllü, "Innovation race under revenue and technology uncertainty of heterogeneous firms where the winner does not take all", IIE Transactions, vol. 48, pp. 527–540, 2016.
Bodur, M., T. Ekim, and Z. C. Taşkın, "Decomposition Algorithms for Solving the Minimum Weight Maximal Matching Problem", Networks, vol. 62, no. 4, pp. 273–287, 2013.
Bonomo, F., D. Cornaz, T. Ekim, and B. Ries, "Perfectness of clustered graphs", Discrete Optimization, vol. 10, no. 4: Elsevier, pp. 296–303, 2013.
Botts, C., W. Hörmann, and J. Leydold, "Transformed density rejection with inflection points", Statistics and Computing, vol. 23, no. 2: Springer US, pp. 251–260, 2013.
Boyacı, A., T. Ekim, M. Shalom, and S. Zaks, Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations, , 2013.
Boyacı, A., T. Ekim, M. Shalom, and S. Zaks, "Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes—Part I", Discrete Applied Mathematics, vol. 215, pp. 47–60, 2016.
de Werra, D., T. Ekim, and C. Raess, "Construction of sports schedules with multiple venues", Discrete Applied Mathematics, vol. 154, no. 1: North-Holland, pp. 47–58, 2006.
Demange, M., T. Ekim, and D. de Werra, "(p, k)-coloring problems in line graphs", Theoretical computer science, vol. 349, no. 3: Elsevier, pp. 462–474, 2005.
Demange, M., T. Ekim, and C. Tanasescu, "Hardness and approximation of minimum maximal matchings", International Journal of Computer Mathematics, no. ahead-of-print: Taylor & Francis, pp. 1–20, 2013.
Demange, M., T. Ekim, D. de Werra, and , "On the approximation of Min Split-coloring and Min Cocoloring.", J. Graph Algorithms Appl., vol. 10, no. 2, pp. 297–315, 2006.
Demange, M., and T. Ekim, "Minimum maximal matching is NP-hard in regular bipartite graphs", Theory and Applications of Models of Computation: Springer, pp. 364–374, 2008.
Demange, M., T. Ekim, and B. Ries, "On the minimum and maximum selective graph coloring problems in some graph classes", Discrete Applied Mathematics, vol. 204, pp. 77–89, 2016.
Demange, M., T. Ekim, and D. de Werra, "Partitioning cographs into cliques and stable sets", Discrete Optimization, vol. 2, no. 2: Elsevier, pp. 145–153, 2005.