Sciweavers

382 search results - page 44 / 77
» Proof Theory for Distributed Knowledge
Sort
View
ATAL
2006
Springer
14 years 7 days ago
False-name-proof combinatorial auction protocol: Groves Mechanism with SubModular Approximation
This paper develops a new combinatorial auction protocol called the Groves Mechanism with SubModular Approximation (GM-SMA). This protocol satisfies the following characteristics:...
Makoto Yokoo, Toshihiro Matsutani, Atsushi Iwasaki
ML
2002
ACM
141views Machine Learning» more  ML 2002»
13 years 8 months ago
On the Existence of Linear Weak Learners and Applications to Boosting
We consider the existence of a linear weak learner for boosting algorithms. A weak learner for binary classification problems is required to achieve a weighted empirical error on t...
Shie Mannor, Ron Meir
WEBI
2010
Springer
13 years 6 months ago
Stochastic Simulation of Web Users
A biologically inspired cognitive model is presented for human decision making and applied to the simulation of the web user. The model is based on the Neurophysiology description ...
Pablo E. Román, Juan D. Velásquez
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
Playing games in many possible worlds
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
Matt Lepinski, David Liben-Nowell, Seth Gilbert, A...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 8 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi