Sciweavers

453 search results - page 83 / 91
» Tight bounds for the partial-sums problem
Sort
View
IPCO
2007
108views Optimization» more  IPCO 2007»
13 years 8 months ago
Robust Combinatorial Optimization with Exponential Scenarios
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S...
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 7 months ago
Distributed Constrained Optimization with Semicoordinate Transformations
Recent work has shown how information theory extends conventional full-rationality game theory to allow bounded rational agents. The associated mathematical framework can be used ...
William G. Macready, David Wolpert
ICDM
2007
IEEE
148views Data Mining» more  ICDM 2007»
13 years 11 months ago
Sample Selection for Maximal Diversity
The problem of selecting a sample subset sufficient to preserve diversity arises in many applications. One example is in the design of recombinant inbred lines (RIL) for genetic a...
Feng Pan, Adam Roberts, Leonard McMillan, David Th...
IPL
2010
119views more  IPL 2010»
13 years 5 months ago
Note on Max Lin-2 above Average
In the Max Lin-2 problem we are given a system S of m linear equations in n variables over F2 in which Equation j is assigned a positive integral weight wj for each j. We wish to ...
Robert Crowston, Gregory Gutin, Mark Jones
ATAL
2009
Springer
14 years 1 months ago
The price of democracy in coalition formation
Whenever rational agents form coalitions to execute tasks, doing so via a decentralized negotiation process—while more robust and democratic—may lead to a loss of efficiency ...
Georgios Chalkiadakis, Edith Elkind, Maria Polukar...