Sciweavers

11371 search results - page 133 / 2275
» The network inhibition problem
Sort
View
EVOW
2007
Springer
15 years 10 months ago
Evaluation of Different Metaheuristics Solving the RND Problem
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...
COCOON
2008
Springer
15 years 8 months ago
Approximating the Generalized Capacitated Tree-Routing Problem
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
Ehab Morsy, Hiroshi Nagamochi
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
16 years 1 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
ACMICEC
2006
ACM
142views ECommerce» more  ACMICEC 2006»
16 years 15 days ago
Trusting advice from other buyers in e-marketplaces: the problem of unfair ratings
In electronic marketplaces populated by self-interested agents, buyer agents would benefit by modeling the reputation of seller agents, in order to make effective decisions abou...
Jie Zhang, Robin Cohen
ICASSP
2011
IEEE
14 years 10 months ago
A knapsack problem formulation for relay selection in secure cooperative wireless communication
—Cooperative jamming (CJ) schemes support secure wireless communication in the presence of one or more eavesdroppers. Larger numbers of cooperative relays provide better secrecy ...
Shuangyu Luo, Hana Godrich, Athina P. Petropulu, H...