In this paper we describe an application of the theory of graph transformations to the practise of language design. In particular, we have defined the static and dynamic semantics ...
This paper proposes the applications of soft computing to deal with the constraints in conventional modelling techniques of the dynamic extrusion process. The proposed technique i...
Leong Ping Tan, Ahmad Lotfi, Eugene Lai, J. B. Hul...
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
Abstract— Constructing climbing behaviors for hyperredundant robots that account for the system dynamics requires a model of robot dynamics under contact and friction. One common...
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...