Learn More
Branch-and-bound and backtracking are widely used for search and optimization problems, but their implementations vary from problem to problem. In this paper we propose a unified approach of program derivation and generation for the two classes of algorithms. We first define a generalized specification for the search strategies, and then derive the(More)
Using formal method PAR, two algorithms involving sequences, a majority problem deterministic algorithmic solution and computing the mode, are derived. From formal functional specifications, problems are partitioned into sub-problems, problem solving recurrences are constructed through formal specification transformation, and then loop invariants are(More)
Using highly configurable semi-automatic approach to algorithmic programs development can improve correctness and productivity. This paper explores a way to use generative techniques to produce the algorithmic programs for searching problem. Based on PAR method and PAR platform, it is to formally develop generic type component and algorithm components, and(More)
  • Haihe Shi
  • 2011
Management Information System (MIS) is a core course of business administration major. However it is hard for students to grasp and practice in real life. The existing problems of current teaching are analyzed in the paper, and a practical teaching approach is proposed to address the existing problems. The approach emphasizes active rational participation(More)
Traditional approaches to apply tabu search method typically require formulating an algorithmic structure for each individual problem. Based on algebraic specifications, the paper presents a unified and mechanical framework for implementing tabu search algorithms for combinatorial optimization problems. We define a generalized specification using high-order(More)
The problem reduction graph (PRG) is a model for formally describing the reduction processes of combinatorial optimization problems and systematically deriving efficient algorithms for the problems. The paper applies the model for several optimization problems including vehicle loading, vehicle routing, and warehouse location, which are typical problems in(More)
Software automation has been viewed as a revolutionary way to improve the dependability and productivity of software. The paper takes the sorting algorithms as study cases, employs PAR method and generic techniques, and derives two abstract generic sorting algorithmic programs, from which a class of concrete sorting algorithmic programs can be generated(More)
The design and analysis of algorithms is one of the two essential cornerstone topics in computer science. However, some students think it hard to grasp and often learn by rote, thus they usually can't improve their ability of algorithm design and algorithm analysis. To address the problem, we advocate the incorporation of formal derivation into the design(More)