1225 search results - page 34 / 245 » The Instance Complexity Conjecture |
EVOW
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This paper describes the application of a hybrid genetic algorithm to a real-world instance of the university course timetabling problem. We address the timetabling of la...
COMPLEXITY
2010
13 years 5 months ago
2010
In this paper we introduce the Partition Task problem class along with a complexity measure to evaluate its instances and a performance measure to quantify the ability of a system...
DLOG
2003
13 years 9 months ago
2003
We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different...
DAGSTUHL
2000
13 years 9 months ago
2000
A strategy S solving a navigation task T is called competitive with ratio r if the cost of solving any instance t of T does not exceed r times the cost of solving t optimally. The ...
ESANN
2008
13 years 9 months ago
2008
In this paper we have defined a novel activation function called the multi-level signum for the real and complex valued associative memories. The major motivation of such a functio...