Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
Michael J. Hirsch, Panos M. Pardalos, Mauricio G. ...
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
— In this paper we use bilevel programming to find the maximum difference between a reference controller and a low-complexity controller in terms of the infinitynorm difference...
In this paper we describe a paradigm for contentfocused matchmaking, based on a recently proposed model for constraint acquisition-and-satisfaction. Matchmaking agents are conceiv...