Sciweavers

1278 search results - page 225 / 256
» The Complexity of Weighted Boolean
Sort
View
ECCC
2006
70views more  ECCC 2006»
13 years 10 months ago
Finding a Heaviest Triangle is not Harder than Matrix Multiplication
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
Artur Czumaj, Andrzej Lingas
COR
2007
143views more  COR 2007»
13 years 10 months ago
Discrete bandwidth allocation considering fairness and transmission load in multicast networks
As a promising solution to tackle the network heterogeneity in multicasting, layered multicast protocols such as Receiver-driven layered multicast (RLM) and Layered video multicas...
Chae Y. Lee, Hee K. Cho
CORR
2007
Springer
121views Education» more  CORR 2007»
13 years 10 months ago
Iterative Filtering for a Dynamical Reputation System
The paper introduces a novel iterative method that assigns a reputation to n + m items: n raters and m objects. Each rater evaluates a subset of objects leading to a n × m rating...
Cristobald de Kerchove, Paul Van Dooren
CORR
2007
Springer
120views Education» more  CORR 2007»
13 years 10 months ago
Distributed Fair Scheduling Using Variable Transmission Lengths in Carrier-Sensing-based Wireless Networks
— The fairness of IEEE 802.11 wireless networks (including Wireless LAN and Ad-hoc networks) is hard to predict and control because of the randomness and complexity of the MAC co...
Libin Jiang, Jean C. Walrand
JNW
2006
88views more  JNW 2006»
13 years 10 months ago
A Genetic Algorithms Based Approach for Group Multicast Routing
Whereas multicast transmission in one-to-many communications allows the operator to drastically save network resources, it also makes the routing of the traffic flows more complex ...
Luca Sanna Randaccio, Luigi Atzori