8917 search results - page 264 / 1784 » Abstraction in Algorithm Animation |
122
Voted
ENTCS
2007
15 years 3 months ago
2007
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem spans over more than three decades, in the last couple of years many ...
135
Voted
JSAC
2006
15 years 3 months ago
2006
Abstract-- This paper addresses the problem of optical signalto-noise ratio (OSNR) optimization in optical networks. An analytical OSNR network model is developed for a general mul...
147
Voted
KES
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Grid computing is a computing framework to meet the growing computational demands. This paper introduces a novel approach based on Particle Swarm Optimization (PSO) for s...
131
Voted
AICOM
2004
15 years 3 months ago
2004
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
157
Voted
ISVC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We propose an improved shape matching algorithm that extends the work of Felzenszwalb [3]. In this approach, we use triangular meshes to represent deformable objects and ...