For planning to come of age, plans must be judged by a measure of quality, such as the total cost of actions. This report describes an optimal-cost planner which guarantees global optimality whenever the planning problem has a solution. We code the extraction of an optimal plan, from a planning graph with a fixed number k of levels, as a weighted constraint satisfaction problem (WCSP). The spec...

The Russian Dolls Search (RDS) algorithm is both a solving procedure and a cost based filtering algorithm suitable for Weighted Constraint Satisfaction Problems (WCSP). In the context of Variable Weighted CSP, we propose a declarative implementation of RDS filtering, using a set of auxiliary variables and constraints. This approach allows relying on a Constraint Programming (CP) solver instead ...

Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze the effects of polynomial-spacebounded learning on runtime complexity of backtrack search. One space-bounded learning scheme records only those constraints with limited size, and another records arbitrarily large cons...

In a supply chain, cross-docking is one of the most innovative systems for ameliorating the operational performance at distribution centers. Cross-docking is a logistics strategy in which freight is unloaded from inbound trucks and (almost) directly loaded into outbound trucks, with little or no storage in between, thus no inventory remains at the distribution center. In this study, we consider...

Several studies have demonstrated that as listeners hear sentences describing events in a scene, their eye movements anticipate upcoming linguistic items predicted by the unfolding relationship between scene and sentence. While this may reflect active prediction based on structural or contextual expectations, the influence of local thematic priming between words has not been fully examined. In ...

Dally [2] has developed a model to investigate the behavior of virtual channel multiplexing which have been widely employed in the subsequent analytical models of most routing algorithms suggested in the literature. It is indispensable to modify Dally’s model in order to evaluate the performance of channel multiplexing in more general networks where restrictions such as timing constraints of in...

This paper presents an algorithm and its implementation for performing scheduling and operator allocation for data path synthesis. Tlte main advantage of this approach is that it is capable of handling global time constraint as compared to earlier systems[l] which expected the designer to artificially impose a time constraint on the individual blocks. This is achieved by judiciously distributin...

Distributed applications are based on algorithms which should be able to deal with time constraints. It is mandatory to express time constraints in (mathematical) models and the current work intends to integrate time constraints in the modelling process based on event B models and refinement. The starting point of our work is the event B development of the IEEE 1394 leader election protocol; fr...