Abstract. Ordering constraints are analogous to instances of the satisfiability problem in conjunctive normalform, but instead of a boolean assignment we consider a linear orderin...
Abstract: We study an instance-based approach for matching hierarchical ontologies, such as product catalogs. The motivation for utilizing instances is that metadata-based match ap...
Abstract. The problem of averaging outcomes under several scenarios to form overall objective functions is of considerable importance in decision support under uncertainty. The fuz...
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
— Program code size is a critical factor in determining the manufacturing cost of many embedded systems, particularly those aimed at the extremely costconscious consumer market. ...