Sciweavers

500 search results - page 63 / 100
» A Sample Approximation Approach for Optimization with Probab...
Sort
View
IJCNN
2006
IEEE
14 years 2 months ago
Learning to Rank by Maximizing AUC with Linear Programming
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
Kaan Ataman, W. Nick Street, Yi Zhang
ICML
1998
IEEE
14 years 8 months ago
Value Function Based Production Scheduling
Production scheduling, the problem of sequentially con guring a factory to meet forecasted demands, is a critical problem throughout the manufacturing industry. The requirement of...
Jeff G. Schneider, Justin A. Boyan, Andrew W. Moor...
TSP
2010
13 years 2 months ago
Randomized and distributed self-configuration of wireless networks: two-layer Markov random fields and near-optimality
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
Sung-eok Jeon, Chuanyi Ji
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
11 years 10 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
BMCBI
2006
116views more  BMCBI 2006»
13 years 8 months ago
A model-based approach to selection of tag SNPs
Background: Single Nucleotide Polymorphisms (SNPs) are the most common type of polymorphisms found in the human genome. Effective genetic association studies require the identific...
Pierre Nicolas, Fengzhu Sun, Lei M. Li