1647 search results - page 38 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
112
click to vote
JPDC
2007
15 years 2 months ago
2007
We study the problem of scheduling unit size jobs on n processors connected by a ring. We show a distributed algorithm for this problem with an approximation ratio of 3 2 + √ 2....
129
Voted
STACS
2005
Springer
15 years 7 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
143
Voted
DAGM
2008
Springer
15 years 4 months ago
2008
Springer
We investigate maximum likelihood parameter learning in Conditional Random Fields (CRF) and present an empirical study of pseudo-likelihood (PL) based approximations of the paramet...
104
click to vote
ICDT
2005
ACM
15 years 7 months ago
2005
ACM
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
154
click to vote
ESA
2011
Springer
14 years 2 months ago
2011
Springer
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...