2027 search results - page 95 / 406 » When is it best to best-respond |
93
Voted
VLSID
1998
IEEE
15 years 5 months ago
1998
IEEE
A partial scan selection strategy is proposed in which flip-flops are selected via newly proposed dynamic reachability and observability measures such that the remaining hard-to-d...
101
click to vote
INFOCOM
1996
IEEE
15 years 5 months ago
1996
IEEE
In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accum...
91
Voted
SWAT
1994
Springer
15 years 4 months ago
1994
Springer
Protocols which can tolerate any number of processors failing by ceasing operation for an unbounded number of steps and resuming operation (with or) without knowing that they were...
VLDB
1990
ACM
15 years 4 months ago
1990
ACM
This paper studies a number of hash-based join algorithms for general purpose multiprocessor computers with shared memory where the amount of memory allocated to the join operatio...
ASPDAC
2007
ACM
15 years 4 months ago
2007
ACM
How to estimate the shortest routing length when certain blocks are considered as routing obstacles is becoming an essential problem for block placement because HPWL is no longer v...