Skip Navigation Links Home : MemberDetails
             
Name : Abdelraouf M. Ishtaiwi

Academic Rank: Assistant Prfoessor

Administrative Position : Faculty Academic Member

Office 7308       Ext No 7308

Email : aishtaiwi@uop.edu.jo

Specialization: Computer Science

Graduate Of: Griffith University

Qualification

    Qualification

    University

    Country

    Year

    Master's
    Griffith University
    Australia
    2001
    Ph.D
    Griffith University
    Australia
    2007



  • Journal Paper





      A. HajYasein an and A. Ishtaiwi, " Survey on Privacy Preserving in Data Mining Tasks " , "albalqa journal for research",Vol.,No., , Amman, jordan, 01/01/2009




      Abstract:
      Abstract—A key characteristic in Dynamic Local Search Techniques (DLS) is the use of weights while searching for a solution to a Satisfiability problems (SAT). Thus, weights handling plays a major role in the over all performance of a given DLS technique. Unfortunately, there are no general appr Download


  • Conference paper





      Ishtaiwi, A., Thornt, " Neighbourhood Clause Weight Redistribution in Local Search for SAT. " , "Principles and Practice of Constraint Programming - CP 2005, 11th International Conference",Vol.,No., Springer, Sitges, Spain, 03/16/2005



      Pham, D. N., Thornto, " SAT-based versus CSP-based Constraint Weighting for Satisfiability. " , "Proceedings of the 20th National Conference on Artificial Intelligence, AAAI 2005",Vol.,No., AAAI Press / The MIT Press 2005, Pittsburgh, Pennsylvania, USA, 03/16/2005



      Ishtaiwi, A., Thornt, " Adaptive Clause Weight Redistribution. " , "",Vol.,No., , , 04/15/2006



      Ishtaiwi, A., Thornt, " Weight Redistribution for Unweighted MAX-SAT " , "AI 2007: Advances in Artificial Intelligence, 20th Australian Joint Conference on Artificial Intelligence.",Vol.,No., Springer, Gold Coast, Australia, 09/04/2007



      Abstract:
      Abstract—Since 1991, tries were made to enhance the stochastic local search techniques (SLS) in many different ways. Some researchers turned their focus on studying the structure of the satisfiability problems to better understand their complexity in order to come up with better algorithms that Download
  • Event Calendar
    <May 2017>
    SunMonTueWedThuFriSat
    123456
    78910111213
    14151617181920
    21222324252627
    28293031