Sciweavers

777 search results - page 25 / 156
» The Refined Process Structure Tree
Sort
View
128
Voted
AMAI
1999
Springer
15 years 2 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen
JCB
2006
115views more  JCB 2006»
15 years 2 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger
98
Voted
ICIP
2000
IEEE
16 years 4 months ago
Document Image Matching Based on Component Blocks
Document image matching is the key technique for document registration and retrieval. In this paper, a new matching algorithm based on document component block list and component ...
Hanchuan Peng, Fuhui Long, Wan-Chi Siu, Zheru Chi,...
COMCOM
2010
276views more  COMCOM 2010»
15 years 2 months ago
Adjustable convergecast tree protocol for wireless sensor networks
For data-collection applications in sensor networks, it is important to ensure base station receives a complete picture about the monitored area. Convergecast is an important commu...
Tzung-Shi Chen, Hua-Wen Tsai, Chih-Ping Chu
96
Voted
EACL
1989
ACL Anthology
15 years 3 months ago
A Metaplan Model For Problem-Solving Discourse
The structure of problem-solving discourse in the expert advising setting can be modeled by adding a layer of metaplans to a plan-based model of the task domain. Classes of metapl...
Lance A. Ramshaw