Most previous work on understanding variable ordering heuristics for constraint satisfaction problems has focused on the ability to recover from bad decisions. It has been demonstrated however that this ability cannot be the full explanation of the quality of a variable ordering heuristic [8]. In this paper, we develop a more complete framework for analyzing heuristics based on optimal policies...

Although various European Union (EU) directives have established the proper legal framework for the provision of a trustful, legally accepted cross border transaction via electronic means, the consumers are still hesitant to use e-commerce. Lack of confidence with regard to the protection of privacy and security of electronic transactions is among the main reasons. This chapter attempts to form...

Contributions to a supply chain’s overall cost function (such as the bullwhip effect) are sensitive to the different players’ ordering policies. This chapter addresses the problem of developing ordering policies which minimise the overall supply chain cost. Evolutionary Algorithms have been used to evolve such ordering policies. The authors of this chapter extend existing research in a number o...

background the lack of effective use of research evidence in policy-making is a major challenge in most low- and middle-income countries (lmics). there is need to package research data into effective policy tools that will help policy-makers to make evidence-informed policy regarding infectious diseases of poverty (idp). the objective of this study was to assess the usefulness of training works...

in this article, a finite horizon, multi product and multi period economic order quantity like seasonal items is considered where demand rate is deterministic and known but variable in each period. the order quantities of items come in batch sizes and the end of the period order quantity and, consequently, demand of customers are zero. in addition, storage space is constrained and the problem ...

We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing an ordering on the R-tree nodes. This ordering has to be 'good', in the sense that it should group 'similar' data rectangles together, to minimize the area and perimeter of the resulting minimum bounding rectangles (M...