By Topic

Computational feasibility of structured matching

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. Goel ; Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA ; T. Bylander

Structured matching is a task-specific technique for selecting one choice out of a small number of alternatives based on a given set of parameters. In structured matching, the knowledge and control for making a decision are integrated within a hierarchical structure. Each node in the hierarchy corresponds to a different aspect of the decision and contains knowledge for directly mapping the results of its children nodes (or selected parameters) into a choice on the subdecision. The root node selects the final choice for the decision. The authors formally characterize the task and strategy of structured matching and analyze its computational complexity. They believe that structured matching captures the essence of what makes a range of decision-making problems computationally feasible to solve

Published in:

IEEE Transactions on Pattern Analysis and Machine Intelligence  (Volume:11 ,  Issue: 12 )