In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...
To model combinatorial decision problems involving uncertainty and probability, we introduce scenario based stochastic constraint programming. Stochastic constraint programs conta...
This paper considers trajectory planning problems for autonomous robots in information gathering tasks. The objective of the planning is to maximize the information gathered withi...
Cindy Leung, Shoudong Huang, Ngai Ming Kwok, Gamin...
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
Menkes Hector Louis van den Briel, Thomas Vossen, ...