15779 search results - page 2486 / 3156 » Change-oriented software engineering |
135
click to vote
FSTTCS
2009
Springer
16 years 23 days ago
2009
Springer
We suggest that extending Muller games with preference ordering for players is a natural way to reason about unbounded duration games. In this context, we look at the standard solu...
155
Voted
FSTTCS
2009
Springer
16 years 23 days ago
2009
Springer
We clarify the role of Kolmogorov complexity in the area of randomness extraction. We show that a computable function is an almost randomness extractor if and only if it is a Kolm...
148
click to vote
FSTTCS
2009
Springer
16 years 23 days ago
2009
Springer
Randomness extractors are efficient algorithms which convert weak random sources into nearly perfect ones. While such purification of randomness was the original motivation for c...
164
click to vote
GECCO
2009
Springer
16 years 23 days ago
2009
Springer
It is a hard problem to understand the search process of particle swarm optimization over high-dimensional domain. The visualization depicts the total search process and then it w...
233
click to vote
OOPSLA
2009
Springer
16 years 22 days ago
2009
Springer
Model evolution is often supported by writing model transformation rules in specialized languages. This presents challenges to those who are unfamiliar with model transformation l...