Sciweavers

3367 search results - page 317 / 674
» Incremental assignment problem
Sort
View
CSR
2009
Springer
16 years 1 months ago
On Random Ordering Constraints
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...
Andreas Goerdt
BTW
2007
Springer
149views Database» more  BTW 2007»
16 years 23 days ago
Instance-based matching of hierarchical ontologies
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...
Andreas Thor, Toralf Kirsten, Erhard Rahm
ECSQARU
2007
Springer
16 years 23 days ago
On Decision Support Under Risk by the WOWA Optimization
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...
Wlodzimierz Ogryczak, Tomasz Sliwinski
ESA
2007
Springer
113views Algorithms» more  ESA 2007»
16 years 23 days ago
Distance Coloring
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...
Alexa Sharp
IPPS
2005
IEEE
16 years 5 days ago
Code-Size Minimization in Multiprocessor Real-Time Systems
— 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. ...
Sanjoy K. Baruah, Nathan Fisher