58 search results - page 7 / 12 » Inclusion Constraints over Non-empty Sets of Trees |
CORR
2008
Springer
13 years 7 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...
COR
2007
13 years 7 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...
CSCLP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
WLP
1997
Springer
13 years 11 months ago
1997
Springer
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
ICDT
2010
ACM
14 years 5 months ago
2010
ACM
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...