Sciweavers

446 search results - page 59 / 90
» Extremal Stable Graphs
Sort
View
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
14 years 1 months ago
Distributed Computation in Dynamic Networks
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...
Fabian Kuhn, Nancy Lynch and Rotem Oshman
TVCG
2008
119views more  TVCG 2008»
13 years 8 months ago
Exploration of Networks using overview+detail with Constraint-based cooperative layout
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...
Tim Dwyer, Kim Marriott, Falk Schreiber, Peter J. ...
CDC
2010
IEEE
139views Control Systems» more  CDC 2010»
13 years 3 months ago
Communication, convergence, and stochastic stability in self-assembly
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...
Michael J. Fox, Jeff S. Shamma
DAC
2003
ACM
14 years 9 months ago
Improved global routing through congestion estimation
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...
Raia Hadsell, Patrick H. Madden
CEC
2009
IEEE
14 years 3 months ago
Representation and structural biases in CGP
— 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...
Andrew J. Payne, Susan Stepney