4798 search results - page 783 / 960 » Time to change |
183
click to vote
NETWORKS
2002
15 years 6 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
151
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
182
click to vote
TC
1998
15 years 6 months ago
1998
—We describe a system-level simulation model and show that it enables accurate predictions of both I/O subsystem and overall system performance. In contrast, the conventional app...
178
click to vote
TCAD
1998
15 years 6 months ago
1998
—Conventional scan design imposes considerable area and delay overheads. To establish a scan chain in the test mode, multiplexers at the inputs of flip-flops and scan wires are...
179
click to vote
SIGMOD
2002
ACM
15 years 6 months ago
2002
ACM
Traditional query processors generate full, accurate query results, either in batch or in pipelined fashion. We argue that this strict model is too rigid for exploratory queries o...