Sciweavers

1388 search results - page 27 / 278
» Approximability of Robust Network Design
Sort
View
ISMIS
2005
Springer
14 years 1 months ago
Robust Inference of Bayesian Networks Using Speciated Evolution and Ensemble
Recently, there are many researchers to design Bayesian network structures using evolutionary algorithms but most of them use the only one fittest solution in the last generation. ...
Kyung-Joong Kim, Ji-Oh Yoo, Sung-Bae Cho
INFOCOM
2010
IEEE
13 years 6 months ago
Markov Approximation for Combinatorial Network Optimization
—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...
Minghua Chen, Soung Chang Liew, Ziyu Shao, Caihong...
ATMOS
2007
138views Optimization» more  ATMOS 2007»
13 years 9 months ago
A new concept of robustness
In this paper a new concept of robustness is introduced and the corresponding optimization problem is stated. This new concept is applied to transportation network designs in which...
Ricardo García, Ángel Marín, ...
TPDS
2008
120views more  TPDS 2008»
13 years 7 months ago
A New Storage Scheme for Approximate Location Queries in Object-Tracking Sensor Networks
Energy efficiency is one of the most critical issues in the design of wireless sensor networks. Observing that many sensor applications for object tracking can tolerate a certain d...
Jianliang Xu, Xueyan Tang, Wang-Chien Lee
MOR
2010
118views more  MOR 2010»
13 years 6 months ago
Strategyproof Approximation of the Minimax on Networks
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...
Noga Alon, Michal Feldman, Ariel D. Procaccia, Mos...