4642 search results - page 760 / 929 » Distributed algorithm and reversible network |
125
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
Parallel programming is elusive. The relative performance of di erent parallel implementations varies with machine architecture, system and problem size. How to compare di erent i...
169
click to vote
DCOSS
2008
Springer
15 years 4 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
117
Voted
OPODIS
2008
15 years 4 months ago
2008
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
222
Voted
GIS
2007
ACM
16 years 3 months ago
2007
ACM
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
GLVLSI
2010
IEEE
15 years 7 months ago
2010
IEEE
Clock skew variations adversely affect timing margins, limiting performance, reducing yield, and may also lead to functional faults. Non-tree clock distribution networks, such as ...