Sciweavers

110 search results - page 14 / 22
» Combinatorial synthesis approach employing graph networks
Sort
View
COMPLIFE
2005
Springer
14 years 1 months ago
The Architecture of a Proteomic Network in the Yeast
Abstract. We describe an approach to clustering the yeast protein-protein interaction network in order to identify functional modules, groups of proteins forming multi-protein comp...
Emad Ramadan, Christopher Osgood, Alex Pothen
GECCO
2003
Springer
162views Optimization» more  GECCO 2003»
14 years 23 days ago
Optimization of Spare Capacity in Survivable WDM Networks
A network with restoration capability requires spare capacity to be used in the case of failure. Optimization of spare capacity is to find the minimum amount of spare capacity for ...
H. W. Chong, Sam Kwong
HM
2007
Springer
137views Optimization» more  HM 2007»
14 years 1 months ago
A Hybrid VNS for Connected Facility Location
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
Ivana Ljubic
CDC
2008
IEEE
162views Control Systems» more  CDC 2008»
14 years 2 months ago
Synchronization in networks of nonlinear oscillators with coupling delays
Abstract— We consider the synchronization problem of an arbitrary number of coupled nonlinear oscillators with delays in the interconnections. The emphasis is on coupled Lorenz s...
Wim Michiels, Henk Nijmeijer
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
14 years 5 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald