Sciweavers

417 search results - page 19 / 84
» Some Theory for Generalized Boosting Algorithms
Sort
View
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
14 years 3 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
SAC
2004
ACM
14 years 2 months ago
A robust deception-free coalition formation model
We study two properties of coalition formation algorithms, very important for their application in real-life scenarios: robustness and tolerance to some agent misbehaviors. The st...
María-Victoria Belmonte, Ricardo Conejo, Jo...
SIGOPS
2010
272views more  SIGOPS 2010»
13 years 7 months ago
The Akamai network: a platform for high-performance internet applications
Comprising more than 61,000 servers located across nearly 1,000 networks in 70 countries worldwide, the Akamai platform delivers hundreds of billions of Internet interactions dail...
Erik Nygren, Ramesh K. Sitaraman, Jennifer Sun
GECCO
2005
Springer
142views Optimization» more  GECCO 2005»
14 years 2 months ago
Goal-oriented preservation of essential genetic information by offspring selection
This contribution proposes an enhanced and generic selection model for Genetic Algorithms (GAs) and Genetic Programming (GP) which is able to preserve the alleles which are part o...
Michael Affenzeller, Stefan Wagner 0002, Stephan M...
SIGECOM
2010
ACM
165views ECommerce» more  SIGECOM 2010»
14 years 1 months ago
Computing optimal strategies to commit to in extensive-form games
Computing optimal strategies to commit to in general normal-form or Bayesian games is a topic that has recently been gaining attention, in part due to the application of such algo...
Joshua Letchford, Vincent Conitzer