4110 search results - page 80 / 822 » Efficient algorithms for the 2-gathering problem |
124
click to vote
AUTOMATICA
2006
15 years 4 months ago
2006
The problem of absolute stability is one of the oldest open problems in the theory of control. Even for the particular case of second-order systems a complete solution was present...
130
click to vote
IJES
2006
15 years 4 months ago
2006
: We present efficient solutions for the non-contiguous linear placement of data-paths for reconfigurable fabrics. A strip-based architecture is assumed for the reconfigurable fabr...
140
click to vote
DATE
2006
IEEE
15 years 7 months ago
2006
IEEE
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
128
click to vote
WSCG
2004
15 years 5 months ago
2004
In this paper we present a new technique for rendering very large datasets representing point-sampled surfaces. Rendering efficiency is considerably improved by using stochastic s...
133
click to vote
CGO
2003
IEEE
15 years 7 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...