Sciweavers

1477 search results - page 120 / 296
» Random Convex Programs
Sort
View
ICALP
2001
Springer
14 years 1 months ago
On the Approximability of Average Completion Time Scheduling under Precedence Constraints
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
Gerhard J. Woeginger
IPPS
1999
IEEE
14 years 1 months ago
Irregular Parallel Algorithms in JAVA
The nested data-parallel programming model supports the design and implementation of irregular parallel algorithms. This paper describes work in progress to incorporate nested data...
Brian Blount, Siddhartha Chatterjee, Michael Phili...
ICALP
1990
Springer
14 years 28 days ago
Determining the Separation of Preprocessed Polyhedra - A Unified Approach
We show how (now familiar) hierarchical representations of (convex) polyhedra can be used to answer various separation queries efficiently (in a number of cases, optimally). Our e...
David P. Dobkin, David G. Kirkpatrick
ATAL
2006
Springer
14 years 19 days ago
Robust mechanisms for information elicitation
We study information elicitation mechanisms in which a principal agent attempts to elicit the private information of other agents using a carefully selected payment scheme based o...
Aviv Zohar, Jeffrey S. Rosenschein
ICML
2010
IEEE
13 years 10 months ago
Robust Formulations for Handling Uncertainty in Kernel Matrices
We study the problem of uncertainty in the entries of the Kernel matrix, arising in SVM formulation. Using Chance Constraint Programming and a novel large deviation inequality we ...
Sahely Bhadra, Sourangshu Bhattacharya, Chiranjib ...