3229 search results - page 305 / 646 » The Theory of Timed Automata |
154
click to vote
GECCO
2003
Springer
16 years 13 hour 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...
225
click to vote
STOC
1996
ACM
15 years 11 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...
218
Voted
DFG
1992
Springer
15 years 11 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...
163
click to vote
BIRTHDAY
2006
Springer
15 years 10 months ago
2006
Springer
The exogenous approach to enriching any given base logic for probabilistic and quantum reasoning is brought into the realm of institutions. The theory of institutions helps in capt...
162
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Semantic structures for belief revision are proposed. We start with one-stage revision structures that generalize the notion of choice function from rational choice theory. A corr...