Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...
Locating public services for nomadic population groups is a difficult challenge as the locations of the targeted populations seasonally change. In this paper, the population group...
—As we all know, Hanoi Problem is a classical case of recursive algorithm in programming. In this paper, we study the problem in another way by numbering the peg from bottom to t...
This study proposes an effective method called DIAMOND to classify biological and medical data. Given a set of objects with some classes, DIAMOND separates the objects into differe...
Karchmer, Kushilevitz and Nisan formulated the formula size problem as an integer programming problem called the rectangle bound and introduced a technique called the LP bound, whi...