2412 search results - page 2 / 483 » Which Problems Have Strongly Exponential Complexity |
SAGT
2010
Springer
13 years 4 months ago
2010
Springer
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
STACS
2005
Springer
13 years 11 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
GECCO
2000
Springer
13 years 9 months ago
2000
Springer
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
INFORMATICALT
2006
13 years 6 months ago
2006
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
TNN
1998
13 years 5 months ago
1998
— In this paper, we study a qualitative property of a class of competitive learning (CL) models, which is called the multiplicatively biased competitive learning (MBCL) model, na...