Abstract. Constraint propagation is one of the techniques central to the success of constraint programming. Fast algorithms are used to prune the search space either before or duri...
We introduce a metaheuristic framework for combinatorial optimization. Our framework is similar to others (e.g. [1]) in that it is modular enough that important components can be i...
In some application domains as composite software, ranging from search engines, to more general applications, like cooperative and distributed applications or e-business and e-comm...
A heuristic technique that combines a genetic algorithm with a Tabu Search algorithm is applied to the Quadratic Assignment Problem (QAP). The hybrid algorithm improves the result...
We describe an approach to personalization that emphasizes the "client side." We posit the need for a highly individualistic user context that resides on the client mach...