Sciweavers

1477 search results - page 249 / 296
» Random Convex Programs
Sort
View
ORL
2006
105views more  ORL 2006»
13 years 7 months ago
Inventory placement in acyclic supply chain networks
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
TASE
2008
IEEE
13 years 7 months ago
New Solution Approaches to the General Single- Machine Earliness-Tardiness Problem
This paper addresses the general single-machine earliness-tardiness problem with distinct release dates, due dates, and unit costs. The aim of this research is to obtain an exact n...
Hoksung Yau, Yunpeng Pan, Leyuan Shi
INFOCOM
2011
IEEE
12 years 11 months ago
Strategyproof auctions for balancing social welfare and fairness in secondary spectrum markets
Abstract—Secondary spectrum access is emerging as a promising approach for mitigating the spectrum scarcity in wireless networks. Coordinated spectrum access for secondary users ...
Ajay Gopinathan, Zongpeng Li, Chuan Wu
DC
2011
12 years 7 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
14 years 8 months ago
Universally utility-maximizing privacy mechanisms
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan