Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
Alexandre Goldsztejn, Yahia Lebbah, Claude Michel,...
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...
Abstract. Signcryption is a cryptographic primitive that aims at providing confidentiality and authentication simultaneously. Recently in May 2008, a scheme for identity based thre...
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Ra...
Fuzzy Description Logics (Fuzzy DLs) and fuzzy OWL have been proposed as languages able to represent and reason about imprecise and vague knowledge. Such extensions have gained con...
In this paper we introduce an object-oriented coordination language for multi-agents systems. The beliefs and reasoning capabilities ent are specified in terms of a corresponding ...
Frank S. de Boer, Cees Pierik, Rogier M. van Eijk,...