5 search results - page 1 / 1 » Maintaining Nets and Net Trees under Incremental Motion |
ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point...
MODELS
2009
Springer
13 years 11 months ago
2009
Springer
We present a novel technique for applying two-level runtime models to distributed systems. Our approach uses graph rewriting rules to transform a high-level source model into one o...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
VLSID
2007
IEEE
14 years 4 months ago
2007
IEEE
Crosstalk noise in the clock network of digital circuits is often detected late in the design cycle, sometimes as late as after first silicon. It is therefore necessary to fix cros...
ICML
2000
IEEE
14 years 5 months ago
2000
IEEE
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...