10901 search results - page 147 / 2181 » Approximations in Distributed Optimization |
180
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
185
click to vote
ICDCS
1999
IEEE
15 years 10 months ago
1999
IEEE
We describe methods of identifying and exploiting sharing patterns in multi-threaded DSM applications. Active correlation tracking is used to determine the affinity, or amount of ...
150
click to vote
AAAI
2006
15 years 7 months ago
2006
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
142
click to vote
JCSS
2008
15 years 6 months ago
2008
We present a polynomial time approximation algorithm for unit time precedence constrained scheduling. Our algorithm guarantees schedules which are at most 2 - 7 3p+1 factor as lon...
179
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
We study the approximability of predicates on k variables from a domain [q], and give a new sufficient condition for such predicates to be approximation resistant under the Unique...