Sciweavers

1090 search results - page 113 / 218
» Priority Algorithms for Graph Optimization Problems
Sort
View
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
14 years 3 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
ICASSP
2011
IEEE
13 years 23 days ago
Heterogeneous multiprocessor mapping for real-time streaming systems
Real-time streaming signal processing systems typically desire high throughput and low latency. Many such systems can be modeled as synchronous data flow graphs. In this paper, w...
Jing Lin, Akshaya Srivatsa, Andreas Gerstlauer, Br...
JDA
2007
129views more  JDA 2007»
13 years 9 months ago
Approximating the k-traveling repairman problem with repairtimes
Given an undirected graph G = (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starti...
Raja Jothi, Balaji Raghavachari
NETWORK
2010
122views more  NETWORK 2010»
13 years 3 months ago
Betweenness centrality and resistance distance in communication networks
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
Ali Tizghadam, Alberto Leon-Garcia
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
14 years 28 days ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali