Many important problems of graph enumeration and indexing can be solved by frontier-based methods, which construct ZDDs in a breadth-first manner from the top to the bottom. We present new techniques toward an efficient framework to deal with the frontier-based methods. Ad hoc parts of the algorithm are encapsulated using the recursive specifications that represent properties to be compiled int...

Heuristic optimization provides a robust and efficient approach for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. The convergence rate and suitable diversity of solutions are of great importance for multi-objective evolutionary algorithms. The focu...

Transitive closure operation is one of the most useful new operations in deductive database systems. When it is added to conventional relational database systems, most practical problems with recursion can be coped with. Therefore, efficient processing of transitive closure is an important task in deductive database systems. Transitive closure operation can be divided into total closure and que...

This report investigates 2nd Fall and 3rd Fall retention rates by Expected Family Contribution (EFC) for recent full-time, first-time (FTFT) freshman cohorts. This report serves as an update to, and extension of, prior retention by EFC reports that focused on 2 Fall Retention as the sole dependent variable. Sub-groups of interest including First Generation students, minority ethnicity students,...

K. THULASIRAMAN, R. JAYAKUMAR, at X can be rearranged such that all the descendant pertinent AND M. N. S. SWAMY leaves of X appear consecutively at either the left or the right end of the frontier, with at least one nonpertinent leaf appearing at Absrruct--In this paper, we first point out that the planarization althe other end of the frontier. gorithm due to Ozawa and Takabashi [4] does not in...

Recent literature on sustainable logistics networks points to two important questions: (i) How to spot the preferred solution(s) balancing environmental and business concerns? (ii) How to improve the understanding of the trade-offs between these two dimensions? We posit that a visual exploration of the efficient frontier and trade-offs between profitability and environmental impacts are particu...

Frontier-based exploration is the most common approach to exploration, a fundamental problem in robotics. In frontierbased exploration, robots explore by repeatedly detecting (and moving towards) frontiers, the segments which separate the known regions from those unknown. A frontier detection sub-process examines map and/or sensor readings to identify frontiers for exploration. However, most fr...

In this paper, a new algorithm is proposed to solve multi-objective optimization problems (MOOPs) through applying the trust-region (TR) method based on local search (LS) techniques; where the MOOP converting to a single objective optimization problem (SOOP) by using reference point method. In the proposed algorithm, some of the points in the search space are generated. For each point the TR al...

In this study, a hybrid approach combining trust region (TR) algorithm and particle swarm optimization (PSO) is proposed to solve multi-objective optimization problems (MOOPs). The proposed approach integrates the merits of both TR and PSO. Firstly, the MOOP converting by weighted method to a single objective optimization problem (SOOP) and some of the points in the search space are generated. ...

We present a new heuristic algorithm to approximately generate the nondominated frontier of bi-objective pure integer linear programs. The proposed algorithm employs a customized version of several existing algorithms in the literature of both single-objective and bi-objective optimization. Our proposed method has two desirable characteristics: (1) There is no parameter to be tuned by users oth...