1738 search results - page 122 / 348 » An algorithmic framework for network reconstruction |
148
click to vote
JDA
2006
15 years 4 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
121
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
149
click to vote
EUSFLAT
2009
2009
Ant Colony Optimization for Distributed Routing Path Optimization in Optical Burst-Switched Networks
15 years 2 months ago
This work describes a distributed framework for routing path optimization in Optical Burst-Switched (OBS) networks that loosely mimics the foraging behaviour of ants observed in na...
144
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: The increasing availability and diversity of omics data in the post-genomic era offers new perspectives in most areas of biomedical research. Graph-based biological ne...
147
click to vote
SIMULATION
2010
14 years 11 months ago
2010
We introduce and describe a novel network simulation tool called NeSSi (Network Security Simulator). NeSSi incorporates a variety of features relevant to network security distingu...