934 search results - page 22 / 187 » A theoretical analysis of the HIFF problem |
CCA
2005
Springer
14 years 11 months ago
2005
Springer
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
The Second Harmonic Generation (SHG), a process that turns out to be a good test case in the physics lab, can also be considered as a fairly simple theoretical test function for g...
AIPS
2008
15 years 2 hour ago
2008
In the sequel we consider the job shop scheduling problem with uncertain durations represented as triangular fuzzy numbers. We propose a new neighbourhood structure for local sear...
AI
2008
Springer
14 years 9 months ago
2008
Springer
Stochastic local search (SLS) algorithms have recently been proven to be among the best approaches to solving computationally hard problems. SLS algorithms typically have a number...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...