14084 search results - page 2538 / 2817 » A Theory for Game Theories |
183
click to vote
CONCUR
2009
Springer
16 years 1 months ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
177
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
177
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...
179
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
The need for a stopping criterion in MOEA’s is a repeatedly mentioned matter in the domain of MOOP’s, even though it is usually left aside as secondary, while stopping criteri...
155
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...