Abstract. Concurrent constraint programming is a simple but powerful framework for computation based on four basic computational ideas: concurrency (multiple agents are simultaneou...
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
: Spatial Dynamic Simulation Systems have three main components: the space dimension, the time dimension and the dynamic process. Dynamic processes have been modeled by transition ...
Bianca Maria Pedrosa, Luiz Camolesi Jr., Gilberto ...
In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such opti...
Conventional global routing minimizes total wire length and congestion. Experiments using large industrial benchmark circuits show that up to 24% of nets in such routing solutions...