2845 search results - page 243 / 569 » Constraints over Ontologies |
150
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
159
click to vote
CPAIOR
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Over the past years, a number of increasingly expressive languages for modelling constraint and optimisation problems have evolved. In developing a strategy to ease the c...
178
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
181
click to vote
COR
2007
15 years 5 months ago
2007
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
260
click to vote
VLDB
2008
ACM
16 years 6 months ago
2008
ACM
Mapping composition is a fundamental operation in metadata driven applications. Given a mapping over schemas 1 and 2 and a mapping over schemas 2 and 3, the composition problem is...