Sciweavers

840 search results - page 127 / 168
» Inapproximability of Combinatorial Optimization Problems
Sort
View
IEAAIE
1994
Springer
14 years 3 months ago
Using the Genetic Algorithm to Find Snake-in-the-Box Codes
Genetic Algorithms are heuristic search schemes based on a model of Darwinian evolution. Although not guaranteed to find the optimal solution, genetic algorithms have been shown t...
Walter D. Potter, Robert W. Robinson, John A. Mill...
SECON
2008
IEEE
14 years 5 months ago
Congestion Control and Channel Assignment in Multi-Radio Wireless Mesh Networks
— We address the problem of congestion control in multi-radio, multi-channel, wireless mesh networks. Compared to its single radio counterpart for which solutions exist, this pro...
Anastasios Giannoulis, Theodoros Salonidis, Edward...
SDM
2012
SIAM
273views Data Mining» more  SDM 2012»
12 years 1 months ago
A Framework for the Evaluation and Management of Network Centrality
Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Exi...
Vatche Ishakian, Dóra Erdös, Evimaria ...
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
14 years 5 months ago
Finding critical backbone structures with genetic algorithms
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
Adam Prügel-Bennett
ICN
2001
Springer
14 years 3 months ago
Backbone Network Design with QoS Requirements
In this paper, we consider the backbone network design problem with a full set of QoS requirements. Unlike previous researches, we consider both the transmission line cost and the ...
Hong-Hsu Yen, Frank Yeong-Sung Lin