We propose a new algorithm to solve sparse linear systems of equations over the integers. This algorithm is based on a p-adic lifting technique combined with the use of block matr...
Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne...
This demonstration presents the concepts, design, and implementation of SCDE, a relational database systems extended with the ability to solve constraint satisfaction problems (CS...
Time is a crucial variable in planning and often requires special attention since it introduces a specific structure along with additional complexity, especially in the case of dec...
The P systems (or membrane systems) are a class of distributed parallel computing devices of a biochemical type, where membrane division is the frequently investigated way for obta...
Abstract. The O-OSCAR software architecture is a problem solving environment for complex scheduling problem that is based on a constraintbased representation. On top of this core r...