Sciweavers

1010 search results - page 69 / 202
» Metabolic networks analysis using convex optimization
Sort
View
INFOCOM
2011
IEEE
14 years 1 months ago
Spherical representation and polyhedron routing for load balancing in wireless sensor networks
—In this paper we address the problem of scalable and load balanced routing for wireless sensor networks. Motivated by the analog of the continuous setting that geodesic routing ...
Xiaokang Yu, Xiaomeng Ban, Wei Zeng, Rik Sarkar, X...
RECOMB
2003
Springer
15 years 10 months ago
Optimizing exact genetic linkage computations
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
Dan Geiger, Maáyan Fishelson
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
14 years 11 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
ISPD
2004
ACM
150views Hardware» more  ISPD 2004»
15 years 3 months ago
Topology optimization of structured power/ground networks
This paper presents an efficient method for optimizing the design of power/ground (P/G) networks by using locally regular, globally irregular grids. The procedure divides the pow...
Jaskirat Singh, Sachin S. Sapatnekar
CORR
2011
Springer
204views Education» more  CORR 2011»
14 years 4 months ago
Accelerated Dual Descent for Network Optimization
—Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rat...
Michael Zargham, A. Ribeiro, Ali Jadbabaie, Asuman...