3146 search results - page 294 / 630 » Efficient Consequence Finding |
153
click to vote
TCAD
2008
15 years 4 months ago
2008
Latency-insensitive protocols allow system-on-chip (SoC) engineers to decouple the design of the computing cores from the design of the intercore communication channels while follo...
130
click to vote
TCS
2008
15 years 4 months ago
2008
Abstract. Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisi...
127
click to vote
TKDE
2008
15 years 4 months ago
2008
We present a genetic algorithm for tackling a file assignment problem for a large-scale video-on-demand system. The file assignment problem is to find the optimal replication and a...
128
click to vote
JCST
2007
15 years 4 months ago
2007
In this paper, we present a fast attack algorithm to find two-block collision of hash function MD5. The algorithm is based on the two-block collision differential path of MD5 that ...
161
Voted
TON
2008
15 years 4 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...