1101 search results - page 203 / 221 » An Algorithm for the Graph Crossing Number Problem |
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We consider the problem of self-healing in networks that are reconfigurable in the sense that they can change their topology during an attack. Our goal is to maintain connectivity...
123
Voted
SOCIALCOM
2010
15 years 15 days ago
2010
Multiple phenomena often diffuse through a social network, sometimes in competition with one another. Product adoption and political elections are two examples where network diffus...
119
Voted
AAIM
2006
Springer
15 years 6 months ago
2006
Springer
Due to the increasing security threats on the Internet, new overlay network architectures have been proposed to secure privileged services. In these architectures, the application...
153
click to vote
AAAI
2010
15 years 4 months ago
2010
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...
114
Voted
SIROCCO
2010
15 years 4 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...