4372 search results - page 223 / 875 » Algorithmic Theories of Everything |
87
Voted
GECCO
2003
Springer
15 years 6 months ago
2003
Springer
We discuss a theory for a realistic, applicable scaled genetic algorithm (GA) which converges asymptoticly to global optima in a coevolutionary setting involving two species. It is...
155
Voted
STOC
1996
ACM
15 years 5 months ago
1996
ACM
We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
145
Voted
DFG
1992
Springer
15 years 5 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
118
Voted
ECAI
1992
Springer
15 years 5 months ago
1992
Springer
Abstract. The paper refutes the general phenomenological argument that knowledge cannot be completely represented by symbols and, hence, symbolic AI does not work. Moreover, the vi...
COLT
2008
Springer
15 years 2 months ago
2008
Springer
Inspired by longstanding lines of research in sociology and related fields, and by more recent largepopulation human subject experiments on the Internet and the Web, we initiate a...