15033 search results - page 99 / 3007 » Complexity Theory and Algorithms |
FTSIG
2010
15 years 1 months ago
2010
157
click to vote
GECCO
2007
Springer
16 years 28 days 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...
154
click to vote
GD
2004
Springer
16 years 4 days 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...
131
click to vote
GECCO
2005
Springer
16 years 8 days 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...
213
click to vote
ENTCS
2006
15 years 6 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...