270 search results - page 38 / 54 » Constraint relaxation in approximate linear programs |
94
Voted
AAAI
2010
15 years 1 months ago
2010
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
107
Voted
AIPS
2008
15 years 2 months ago
2008
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
106
Voted
ASPDAC
2008
ACM
15 years 2 months ago
2008
ACM
Nowadays many customised embedded processors offer the possibility of speeding up an application by implementing it using Application-Specific Functional units (AFUs). However, th...
109
click to vote
CORR
2002
Springer
15 years 8 days ago
2002
Springer
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
123
click to vote
ORL
2006
15 years 11 days ago
2006
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...