55 search results - page 4 / 11 » A time efficient Delaunay refinement algorithm |
VLSID
2002
IEEE
13 years 11 months ago
2002
IEEE
à This paper addresses the problem of static and dynamic variable voltage scheduling of multi-rate periodic task graphs (i.e., tasks with precedence relationships) and aperiodic t...
IMR
2004
Springer
13 years 11 months ago
2004
Springer
In this paper, we propose a robust isotropic tetrahedral mesh generation method. An advancing front method is employed to control local mesh density and to easily preserve the ori...
TSP
2010
13 years 22 days ago
2010
Abstract--This paper proposes a general framework to effectively estimate the unknown timing and channel parameters, as well as design efficient timing resynchronization algorithms...
JGAA
2000
13 years 5 months ago
2000
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
GD
1998
Springer
13 years 10 months ago
1998
Springer
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...