Sciweavers

3958 search results - page 86 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
FMOODS
2006
15 years 6 months ago
Defining Object-Oriented Execution Semantics Using Graph Transformations
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 ...
Harmen Kastenberg, Anneke Kleppe, Arend Rensink
ASC
2004
15 years 4 months ago
Soft computing applications in dynamic model identification of polymer extrusion process
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...
ECCV
2002
Springer
16 years 6 months ago
What Energy Functions Can Be Minimized via Graph Cuts?
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...
Vladimir Kolmogorov, Ramin Zabih
126
Voted
ICRA
2005
IEEE
90views Robotics» more  ICRA 2005»
15 years 10 months ago
Dynamic Ambiguities in Frictional Rigid-body Systems with Application to Climbing via Bracing
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...
Aaron Greenfield, Alfred A. Rizzi, Howie Choset
144
Voted
GLOBECOM
2006
IEEE
15 years 11 months ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
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...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang