1259 search results - page 97 / 252 » On Survivable Access Network Design: Complexity and Algorith... |
137
click to vote
GLOBECOM
2010
IEEE
15 years 2 months ago
2010
IEEE
We consider the channel selection problem in a cognitive radio network with heterogenous channel availabilities at different nodes. We formulate the maximum channel selection (MCS)...
115
click to vote
MOBIDE
2005
ACM
15 years 10 months ago
2005
ACM
The increasing popularity of mobile devices and the support of web portals towards performing transactions from these mobile devices has enabled business on the move. However, int...
124
click to vote
ALGORITHMICA
2008
15 years 4 months ago
2008
Color-coding is a technique to design fixed-parameter algorithms for several NP-complete subgraph isomorphism problems. Somewhat surprisingly, not much work has so far been spent ...
144
click to vote
CONPAR
1992
15 years 8 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
155
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—We introduce a novel protection scheme, called Cooperative Fast Protection (CFP), to fight against a single link failure in survivable WDM (Wavelength Division Multiplexing) mes...