Using locally backtracking methods to solve temporal constraint satisfaction problems
碩士 === 國立臺灣大學 === 資訊工程研究所 === 81 === In this thesis we provide a heuristic method for solving te- mporal constraint satisfaction problems (TCSP) based on the for- malism of temporal constraint network. In this formalism variab- les represen...
Main Authors: | Wang,Jenn-Jyh, 王鎮志 |
---|---|
Other Authors: | Hsu,Ching-Chi |
Format: | Others |
Language: | zh-TW |
Published: |
1993
|
Online Access: | http://ndltd.ncl.edu.tw/handle/05388805476402118058 |
Similar Items
-
Perancangan Aplikasi Kids Menu Care Berbasis Constraint Satisfaction Problem dan Algoritma Backtracking
by: Syefrida Yulina, et al.
Published: (2017-11-01) -
The backtracking survey propagation algorithm for solving random K-SAT problems
by: Raffaele Marino, et al.
Published: (2016-10-01) -
The backtracking algorithm and different representations for solving Sudoku Puzzles
by: Ekström, Johan, et al.
Published: (2014) -
IDDQ Testing:A Backtracking Method to Generate Complete Test Patterns for Leakage Faults
by: Wu, Jyh-wei, et al.
Published: (1997) -
Solving some constraint satisfaction problems with the ATMS
by: CHEN,PEI-CHAO, et al.
Published: (1990)