Schema Matching is the problem of identifying corresponding elements in different schemas. Discovering these correspondences or matches is inherently difficult to automate. Past s...
Jayant Madhavan, Philip A. Bernstein, AnHai Doan, ...
The problemofmultipleglobalcomparisonin familiesof biologicalsequences has been wellstudied. Fewer algorithms have been developed for identifying local consensus patterns or motif...
Yuh-Jyh Hu, Suzanne B. Sandmeyer, Dennis F. Kibler
Abstract—Manufacturing process variations lead to circuit timing variability and a corresponding timing yield loss. Traditional corner analysis consists of checking all process c...
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
This paper presents an architecture for solving generically the problem of extracting the constraints of a given task in a programming by demonstration framework and the problem...