In this paper we present Cardinal, a general finite sets constraint solver just made publicly available in ECLiPSe Prolog, suitable for combinatorial problem solving by exploiting ...
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
Amit Chandel, Nick Koudas, Ken Q. Pu, Divesh Sriva...
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
A Riemannian-geometry approach for control and stabilization of dynamics of object manipulation under holonomic or non-holonomic (but Pfaffian) constraints is presented. First, pos...
Abstract. In current dynamic business environment, it has been argued that certain characteristics of ad-hocism in business processes are desirable. Such business processes typical...