35419 search results - page 136 / 7084 » How are we doing |
129
Voted
JAIR
2006
15 years 3 months ago
2006
We characterize the search landscape of random instances of the job shop scheduling problem (JSP). Specifically, we investigate how the expected values of (1) backbone size, (2) d...
127
Voted
PE
2006
Springer
15 years 3 months ago
2006
Springer
We ask the question, "for minimizing mean response time (sojourn time), which is preferable: one fast server of speed 1, or k slow servers each of speed 1/k?" Our settin...
143
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
118
click to vote
ICIP
2002
IEEE
16 years 5 months ago
2002
IEEE
We present a simple, original method to improve piecewise linear interpolation with uniform knots: We shift the sampling knots by a fixed amount, while enforcing the interpolation...
142
Voted
CIE
2005
Springer
15 years 9 months ago
2005
Springer
We argue that there is currently no satisfactory general framework for comparing the extensional computational power of arbitrary computational models operating over arbitrary doma...