Sciweavers

291 search results - page 31 / 59
» Factor 2 Approximation Algorithm for the Generalized Steiner...
Sort
View
ADHOCNETS
2009
Springer
14 years 2 months ago
Improved Topology Control Algorithms for Simple Mobile Networks
Topology control is the problem of assigning powers to the nodes of an ad hoc network so as to create a specified network topology while minimizing the energy consumed by the netw...
Fei Che, Errol L. Lloyd, Liang Zhao
SPAA
2009
ACM
14 years 8 months ago
Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network desi
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scala...
Melih Onus, Andréa W. Richa
GECCO
2007
Springer
558views Optimization» more  GECCO 2007»
14 years 1 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
101views ECommerce» more  SIGECOM 2005»
14 years 28 days ago
Fairness and optimality in congestion games
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Na...
SODA
2008
ACM
200views Algorithms» more  SODA 2008»
13 years 8 months ago
Clustering for metric and non-metric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
Marcel R. Ackermann, Johannes Blömer, Christi...