Sciweavers

4131 search results - page 210 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
DISOPT
2011
175views Education» more  DISOPT 2011»
14 years 7 months ago
Strengthening lattice-free cuts using non-negativity
In recent years there has been growing interest in generating valid inequalities for mixedinteger programs using sets with 2 or more constraints. In particular, Andersen et al. (2...
Ricardo Fukasawa, Oktay Günlük
128
Voted
CIARP
2003
Springer
15 years 7 months ago
Uniclass and Multiclass Connectionist Classification of Dialogue Acts
Classification problems are traditionally focused on uniclass samples, that is, each sample of the training and test sets has one unique label, which is the target of the classific...
María José Castro Bleda, David Vilar...
129
Voted
AAAI
2008
15 years 6 months ago
Zero-data Learning of New Tasks
We introduce the problem of zero-data learning, where a model must generalize to classes or tasks for which no training data are available and only a description of the classes or...
Hugo Larochelle, Dumitru Erhan, Yoshua Bengio
148
Voted
INFOCOM
2011
IEEE
14 years 7 months ago
Finite-horizon energy allocation and routing scheme in rechargeable sensor networks
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...
Shengbo Chen, Prasun Sinha, Ness B. Shroff, Changh...
160
Voted
ICALP
2010
Springer
15 years 8 months ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi