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,...
This paper presents our on-going research into selforganizing and self-healing networks of resource brokers, for use in complex Peer-to-Peer (P2P) resource sharing and Grid comput...
In this paper, we consider a discrete-time queue of Geo/Geo/c type with geometric repeated attempts. It is known that its continuous counterpart, namely the M/M/c queue with expon...
Jesus R. Artalejo, Antonis Economou, Antonio G&oac...
This article discusses an enhanced polygonization algorithm for variational implicit surfaces. The polygonization scheme is a simple hierarchical adaptation of the Marching Cubes ...
Research in learning algorithms and sensor hardware has led to rapid advances in artificial systems over the past decade. However, their performance continues to fall short of the ...