446 search results - page 59 / 90 » Extremal Stable Graphs |
145
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
141
click to vote
TVCG
2008
15 years 3 months ago
2008
A standard approach to large network visualization is to provide an overview of the network and a detailed view of a small component of the graph centred around a focal node. The u...
121
click to vote
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
Existing work on programmable self assembly has focused on deterministic performance guarantees--stability of desirable states. In particular, for any acyclic target graph a binary...
104
click to vote
DAC
2003
ACM
16 years 4 months ago
2003
ACM
In this paper, we present a new method to improve global routing results. By using an amplified congestion estimate to influence a rip-up and reroute approach, we obtain substanti...
130
Voted
CEC
2009
IEEE
15 years 10 months ago
2009
IEEE
— An evolutionary algorithm automatically discovers suitable solutions to a problem, which may lie anywhere in a large search space of candidate solutions. In the case of Genetic...