26354 search results - page 43 / 5271 » How we refactor, and how we know it |
JAIR
2006
13 years 7 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...
PE
2006
Springer
13 years 7 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...
CORR
2011
Springer
13 years 2 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...
ICIP
2002
IEEE
14 years 9 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...
SSS
2009
Springer
14 years 9 days ago
2009
Springer
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we are interested in message forwarding problem in a m...