Motion completion, as a challenging and fundamental problem, is of great significance in film game applications. For different motion completion application scenarios (in-betweening, in-filling, blending), most previous methods deal with the problems case-by-case methodology designs. In this work, we propose simple but effective method to solve multiple under unified framework achieves new stat...

In this paper, we consider the recognition problem on three classes of perfect graphs, namely, the HH-free, the HHDfree, and the Welsh-Powell opposition graphs (or WPO-graphs). In particular, we prove properties of the chordal completion of a graph and show that a modified version of the classic linear-time algorithm for testing for a perfect elimination ordering can be efficiently used to dete...

naturally all activities are along with risk and uncertainties. project risk has the concept more than the financial concept. in project management, risks are events that can occur during the project implementation and has negative effects on project completion and meeting goals. identification, analysis, prioritizing and having plan for dealing with these events are playing an important role i...

We give the rst Goal-Directed version of the Knuth Bendix Completion Procedure. Our procedure is based on Basic Completion and SOUR Graphs. There are two phases to the procedure. The rst phase, which runs in polynomial time, compiles the equations and the goal into a constrained tree automata representing the completed system, and a set of constraints representing goal solutions. The second pha...

Preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. In this paper, the same problem has been considered in which objective is to minimize the mean flow time. To prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. O...

Construction projects are complex in nature, which requires systematic and rational approach for decision-making. Linear Programming (LP) is one such technique widely used for optimal decision-making in a rigid environment. In LP model, the objective function and the constraints cannot be represented precisely in linguistic form causing difficulty in representing a real world problem. Usually, ...