• The Transactions of the Korea Information Processing Society
• /
• v.4 no.4
• /
• pp.982-992
• /
• 1997

Almost all the software develpoment cost is especially spwnede in the test phase of kifecycle.Backtracking method and program slicing methed are often used for debugging.But these have need of abundant experience on debuggers or can't apply for large scale programs.In this paper, I used informations of design documents which is generally used, and proposed a new determination method of error positions combining backtracking method and program slcing method.I described several fundamental concepts, error classes, standard design documents and determination method of error positions to porpose a debugging method, and I explained the process of proposed method using an example program with errors.Finally, I compared and analysed the proposed method with usual slicing methods.

• Industrial Engineering and Management Systems
• /
• v.8 no.4
• /
• pp.239-246
• /
• 2009

This paper deals with the makespan minimization problem of job shops. The problem is known as one of hard problems to optimize, and therefore, many heuristic methods have been proposed by many researchers. The aim of this study is also to propose a heuristic scheduling method for the problem. However, the difference between the proposed method and many other heuristics is that the proposed method is based on depth-first branch and bound, and thus it is possible to find an optimal solution at least in principle. To accelerate the search, when a node is judged hopeless in the search tree, the proposed flexible branch and bound method can indicate a higher backtracking node. The unexplored nodes are stored and may be explored later to realize the strict optimization. Two methods are proposed to generate the backtracking point based on the critical path of the current best feasible schedule, and the minimum lower bound for the makespan in the unexplored sub-problems. Schedules are generated based on Giffler and Thompson's active schedule generation algorithm. Acceleration of the search by the flexible branch and bound is confirmed by numerical experiment.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.49-57
• /
• 2007

The P2P distributed systems are proceeded various studies lively to use the idleness computing resources under the network connected computing environments. It's a general mean to communication from the peer of the shortest downloaded time among same target files to be searched. The P2P search algorithms are very important primary factor to decide a real downloaded time in the criteria to select the peer of a shortest downloaded time. However the peer to give resources could be changed into offline status because the P2P distributed systems have very weakness connection. In these cases. we have a choice to retransmit resources mainly. In this study, we suggested an effective backtracking search algorithm to improve the performance about the request to retransmit the resource.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.4
• /
• pp.155-161
• /
• 2017

This paper suggests polynomial time solution algorithm for Sudoku puzzle problem. This problem has been known NP (non-deterministic polynomial time)-complete. The proposed algorithm set the initial value of blank cells to value range of [$1,2,{\cdots},9$]. Then the candidate set values in blank cells deleted by preassigned clue in row, column, and block. We apply the basic rules of Stuart, and proposes two additional rules. Finally we apply binary backtracking(BBT) technique. For the experimental Sudoku puzzle with various categories of solution, the BBT algorithm can be obtain all of given Sudoku puzzle regardless of any types of solution.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.4
• /
• pp.127-135
• /
• 2011

Efficient ordering of decision variables is one of the methods that find solutions quickly in the depth first search using backtracking. At this time, development of variables ordering algorithms considering dynamic and static properties of the problems is very important. However, to exploit optimal variable ordering algorithms appropriate to the problems. In this paper, we propose a problem classifying rule which provides problem type based on variables' properties, and use this rule to predict optimal type of variable ordering algorithms. We choose frequency allocation problem as a DS-type whose decision variables have dynamic and static properties, and estimate optimal variable ordering algorithm. We also show the usefulness of problem classifying rule by applying base station problem as a special case whose problem type is not generated from the presented rule.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.2
• /
• pp.151-159
• /
• 2014

We discuss the implementation of a compiler for an imperative programming language, using monad in Haskell. This compiler involves a recursive-descent parser conducting nondeterministic parsing, in which backtracking occurs to try with other rules when the application of a production rule fails to parse an input string. Haskell has some strong facilities for parsing. Its algebraic types represent abstract syntax trees in a smooth way, and program codes by monad parsing are so concise that they are highly readable and code size is reduced significantly, comparing with other languages. We also deal with the runtime environment of the assembler and code generation whose target is the Stack-Assembly language based on a stack machine.

• Journal of the Institute of Convergence Signal Processing
• /
• v.24 no.3
• /
• pp.172-177
• /
• 2023

In this paper, 2-dimensional backtracking method for ultrasonic signals. Ultrasonic sensors are a common technology used in industrial fields as many studies have been conducted on distance measurement and indoor location tracking using transmission and reception devices in pairs. A method for tracking a signal of an arbitrary ultrasonic transmission device on a 2D plane using only a receiver of an ultrasonic signal is proposed. In order to track the ultrasonic signal, the receiver receives the signal by making at least three. The three receivers may calculate a direction and a distance using a time difference in which the ultrasound reception sound is reached. The existing method of tracking signal sources using ultrasonic waves has a problem of time synchronization of devices because the transceivers must be paired or installed independently for each sensor. In order to solve this problem, the distance of the ultrasonic receiver is minimized, and it is configured as one device. The sensor installed as one device may be processed by one operator, thereby solving the time synchronization problem. To increase time difference accuracy, high-speed 32-bit timers with high time resolution can be used to quickly calculate and track distances and directions.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.04a
• /
• pp.136-145
• /
• 1993

This paper considers a reliability problem as a special type of flow problem and presents an algorithm to evaluate the exact 2-terminal reliability of networks by using a backtracking technique. It employs a polygon-to-chain reduction in addition to series and parallel reduction techniques to reduce execution time. In comparisons, it presents a much better performance than other algorithms known to us. We also propose a methodology to apply the algorithm for approximation of the system reliability.

• Electronics and Telecommunications Trends
• /
• v.8 no.4
• /
• pp.177-185
• /
• 1993

본 고에서는 기존의 maximal cliques 탐색 알고리즘들을 조사하여 분석하고 문제점들을 제시하여 상호 비교 분석함으로써 maximal cliques를 탐색하는 분야에 대한 알고리즘의 체계를 파악하고 기여할 수 있도록 노력하였다. 특히 기존의 clique 탐색 알고리즘들을 그들이 사용하는 기법에 따라서 point sequence method, line addition and removal technique, backtracking technique, 그리고 stack operation technique로 분류하고 각 기법에 해당하는 사례 알고리즘들을 분석하여 장단점들을 파악하며 상호 비교 분석하는데 그 초점을 맞추었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.667-669
• /
• 1999

최근 VLSI 디자인의 비용과 복잡성은 디자인 과정에서 필수조건이다. 소자 모델링과 수치적 방법은 spice와 같은 회로 시뮬레이터를 사용하여 얻을 수 있으며 simulated annealing과 같은 기법의 기술적인 장점은 많은 부분에서 응용된다. 이러한 기법들은 다량의 메모리 제조와 소규모 연구의 프로젝트까지 거의 모든 칩 디자인에 사용된다. 따라서 본 논문에서는 VLSI 회로의 패턴 매칭에 관한 역트랙킹(backtracking) 깊이-우선 탐색을 할 수 있는 그래프 탐색 매칭 알고리즘을 제안하였다.