Now showing items 1-4 of 4

    • Graph visualization toolkits 

      Dogrusoz, U.; Feng, Q.; Madden, B.; Doorley, M.; Frick, A. (IEEE, 2002)
      The Graph Layout Toolkit and Graph Editor Toolkit, which provide a framework for graph visualization useful in a broad array of application areas are introduced. As such, an architectural overview of these tools is presented ...
    • On the QAP polytope and a related inequality system 

      Amcaoğlu, Beşir U (Bilkent University, 1997)
      The Quadratic Assignment Problem is computationally one of the most dilficult NP-Hard problems. Recently, in 1996, Oguz introduced the so called ’triangle constraints’ into an extended model of the Travelling .Salesman problem ...
    • An overview of regression techniques for knowledge discovery 

      Uysal, İ.; Güvenir, H. A. (Cambridge University Press, 1999)
      Predicting or learning numeric features is called regression in the statistical literature, and it is the subject of research in both machine learning and statistics. This paper reviews the important techniques and algorithms ...
    • Quadratic assignment problem : linearizations and polynomial time solvable cases 

      Erdoğan, Güneş (Bilkent University, 2006)
      The Quadratic Assignment Problem (QAP) is one of the hardest combinatorial optimization problems known. Exact solution attempts proposed for instances of size larger than 15 have been generally unsuccessful even ...