14165 search results - page 220 / 2833 » The generalized two-server problem |
163
click to vote
FSTTCS
1991
Springer
15 years 8 months ago
1991
Springer
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
134
click to vote
FLAIRS
2006
15 years 5 months ago
2006
In this paper we test whether a correlation exists between the optimal mutation rate and problem difficulty. We find that the range of optimal mutation rates is inversely proporti...
146
click to vote
AAAI
1994
15 years 5 months ago
1994
New approaches to solving constraint satisfaction problems using iterative improvement techniques have been found to be successful on certain, very large problems such as the mill...
153
click to vote
CSR
2009
Springer
15 years 5 months ago
2009
Springer
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
107
click to vote
COR
2010
15 years 4 months ago
2010
In this paper, we consider the recovery of an airline schedule after an unforeseen event called disruption, making the planned schedule infeasible. We present a modeling framework...