Sciweavers

337 search results - page 13 / 68
» Network design with weighted players
Sort
View
INFOCOM
2006
IEEE
15 years 3 months ago
Using Repeated Games to Design Incentive-Based Routing Systems
Abstract— Incorporating pricing information in routing systems has been explored in various contexts and fashions. In this paper we examine certain fundamental properties importa...
Michael Afergan
INFOCOM
2009
IEEE
15 years 4 months ago
On Mechanism Design without Payments for Throughput Maximization
—It is well-known that the overall efficiency of a distributed system can suffer if the participating entities seek to maximize their individual performance. Consequently, mecha...
Thomas Moscibroda, Stefan Schmid
EVOW
2005
Springer
15 years 3 months ago
Design of Fast Multidimensional Filters Using Genetic Algorithms
A method for designing fast multidimensional filters using genetic algorithms is described. The filter is decomposed into component filters where coefficients can be sparsely sc...
Max Langer, Björn Svensson, Anders Brun, Mats...
STOC
2003
ACM
137views Algorithms» more  STOC 2003»
15 years 10 months ago
Near-optimal network design with selfish agents
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
Elliot Anshelevich, Anirban Dasgupta, Éva T...
AINA
2008
IEEE
15 years 4 months ago
Exploiting Frequent Episodes in Weighted Suffix Tree to Improve Intrusion Detection System
In this paper we proposed a weighted suffix tree and find out it can improve the Intrusion Detection System (IDS). We firstly focus on the analysis of computer kernel system call,...
Min-Feng Wang, Yen-Ching Wu, Meng-Feng Tsai