11371 search results - page 236 / 2275 » The network inhibition problem |
171
click to vote
CONEXT
2006
ACM
16 years 19 days ago
2006
ACM
Network traffic matrices are important for various network planning and management operations. Previous work for estimation of traffic matrices is based on either link load record...
207
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
176
click to vote
SSD
2009
Springer
16 years 1 months ago
2009
Springer
Given a collection of sensors monitoring a flow network, the problem of discovering teleconnected flow anomalies aims to identify strongly connected
177
click to vote
LPNMR
2009
Springer
15 years 11 months ago
2009
Springer
This note summarizes the use of Answer Set Programming to solve various computational problems to infer phylogenetic trees and phylogenetic networks, and discusses its applicabilit...
175
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...