Sciweavers

199 search results - page 3 / 40
» Complexity of two dual criteria scheduling problems
Sort
View
CVPR
2012
IEEE
11 years 11 months ago
Complex loss optimization via dual decomposition
We describe a novel max-margin parameter learning approach for structured prediction problems under certain non-decomposable performance measures. Structured prediction is a commo...
Mani Ranjbar, Arash Vahdat, Greg Mori
SIAMJO
2008
117views more  SIAMJO 2008»
13 years 9 months ago
Two Algorithms for the Minimum Enclosing Ball Problem
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
E. Alper Yildirim
MP
2008
94views more  MP 2008»
13 years 9 months ago
The complexity of recognizing linear systems with certain integrality properties
Let A be a 0 - 1 matrix with precisely two 1's in each column and let 1 be the all-one vector. We show that the problems of deciding whether the linear system Ax 1, x 0 (1)...
Guoli Ding, Li Feng, Wenan Zang
EAAI
2006
123views more  EAAI 2006»
13 years 9 months ago
Applications of artificial intelligence for optimization of compressor scheduling
This paper presents a feasibility study of evolutionary scheduling for gas pipeline operations. The problem is complex because of several constraints that must be taken into consi...
Hanh H. Nguyen, Christine W. Chan
ACTA
1998
111views more  ACTA 1998»
13 years 8 months ago
Machine Scheduling with Availability Constraints
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
Eric Sanlaville, Günter Schmidt