697 search results - page 20 / 140 » On the Theory of Average Case Complexity |
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract. Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory [17]. Yet several works have shown how quantum theory as it stands c...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
—In this paper we discuss the use of cooperative game theory for analyzing interference channels. We extend our previous work, to games with N players as well as frequency select...
HICSS
2002
IEEE
14 years 22 days ago
2002
IEEE
Whereas previous studies have been primarily focused on the structural features of Information Technology governance, this paper describes an exploratory study of IT governance pr...
COLT
2000
Springer
13 years 11 months ago
2000
Springer
In the present paper, we present the theoretical basis, as well as an empirical validation, of a protocol designed to obtain effective VC dimension estimations in the case of a si...