Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
Abstract. A model of granular computing (GrC) is proposed by reformulating, re-interpreting, and combining results from rough sets, quotient space theory, and belief functions. Two...
—Secure multiparty computation is a very important research topic in cryptography. A secure multi-party computation involves N untrusful parties. It takes input xi from the ith p...
— One of the most important problems in Mobile Robotics is to realise the complete robot’s autonomy. In order to achieve this goal several tasks have to be accomplished. Among ...
Andrea Gasparri, Stefano Panzieri, Federica Pascuc...
: This paper brings together two research areas, i.e. “Data Warehouses” and “Temporal Databases”, involving representation of time. Looking at temporal aspects within a dat...