15033 search results - page 99 / 3007 » Complexity Theory and Algorithms |
24
Voted
FTSIG
2010
14 years 10 months ago
2010
114
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced generalization of traditional particle swarm optimization (PSO) that applies to all combinatorial spaces. The...
117
Voted
GD
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This paper surveys the theory of bidimensional graph problems. We summarize the known combinatorial and algorithmic results of this theory, the foundational Graph Minor r...
92
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...
169
Voted
ENTCS
2006
15 years 3 months ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...