Sciweavers

205 search results - page 17 / 41
» When Can Limited Randomness Be Used in Repeated Games
Sort
View
98
Voted
INFOCOM
2007
IEEE
15 years 7 months ago
Toward Optimal Data Aggregation in Random Wireless Sensor Networks
Abstract— Data gathering is one of the most important services provided by wireless sensor networks (WSNs). Since the predominant traffic pattern in data gathering services is m...
Rong Zheng, Richard J. Barton
P2P
2005
IEEE
15 years 6 months ago
Quantifying Agent Strategies under Reputation
Our research proposes a simple buyer/seller game that captures the incentives dictating the interaction between peers in resource trading peer-to-peer networks. We prove that for ...
Sergio Marti, Hector Garcia-Molina
94
Voted
SIGECOM
2005
ACM
97views ECommerce» more  SIGECOM 2005»
15 years 6 months ago
Complexity of (iterated) dominance
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
Vincent Conitzer, Tuomas Sandholm
101
Voted
BMCBI
2008
169views more  BMCBI 2008»
15 years 24 days ago
A comprehensive comparison of random forests and support vector machines for microarray-based cancer classification
Background: Cancer diagnosis and clinical outcome prediction are among the most important emerging applications of gene expression microarray technology with several molecular sig...
Alexander R. Statnikov, Lily Wang, Constantin F. A...
AUSAI
2003
Springer
15 years 6 months ago
Choosing Learning Algorithms Using Sign Tests with High Replicability
An important task in machine learning is determining which learning algorithm works best for a given data set. When the amount of data is small the same data needs to be used repea...
Remco R. Bouckaert