Sciweavers

570 search results - page 29 / 114
» Approximating Some Network Design Problems with Node Costs
Sort
View
175
Voted
GECCO
2007
Springer
558views Optimization» more  GECCO 2007»
15 years 7 months ago
A chain-model genetic algorithm for Bayesian network structure learning
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
Ratiba Kabli, Frank Herrmann, John McCall
SIGECOM
2005
ACM
92views ECommerce» more  SIGECOM 2005»
15 years 7 months ago
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
Edith Elkind
IWCMC
2010
ACM
15 years 6 months ago
Energy-aware online routing with QoS constraints in multi-rate wireless ad hoc networks
Wireless ad hoc networks consist of hundreds to thousands of mobile nodes that are powered by batteries. To prolong the network operational time, energy conservation in such netwo...
Wei Yang, Weifa Liang, Jun Luo, Wenhua Dou
GECCO
2006
Springer
158views Optimization» more  GECCO 2006»
15 years 5 months ago
Exploring network topology evolution through evolutionary computations
We present an evolutionary methodology that explores the evolution of network topology when a uniform growth of the network traffic is considered. The network redesign problem is ...
Sami J. Habib, Alice C. Parker
ICN
2001
Springer
15 years 6 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