4524 search results - page 172 / 905 » The Complexity of Global Constraints |
182
click to vote
EPIA
1993
Springer
15 years 10 months ago
1993
Springer
Abstract. This work presents a constraint solver for the domain of rational trees. Since the problem is NP-hard the strategy used by the solver is to reduce as much as possible, in...
176
click to vote
ACL
1990
15 years 7 months ago
1990
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...
146
click to vote
CP
2005
Springer
16 years 2 days ago
2005
Springer
Interacting with a web service enabled marketplace in order to achieve a complex task involves sequencing a set of individual service operations, gathering information from the ser...
164
click to vote
ENTCS
2010
15 years 6 months ago
2010
Abstract. Web services composition is the interleaving of action sequences executed by elementary components in accordance with a client specification. We consider Web services as ...
172
click to vote
ACTA
1998
15 years 6 months ago
1998
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...