2905 search results - page 137 / 581 » Formal Memetic Algorithms |
116
click to vote
NIPS
2000
15 years 5 months ago
2000
We study the problem of combining the outcomes of several different classifiers in a way that provides a coherent inference that satisfies some constraints. In particular, we deve...
98
Voted
COLING
1996
15 years 5 months ago
1996
This paper describes an interactive graphical environment for computational semantics. The system provides a teaching tool, a stand alone extendible grapher, and a library of algo...
DAM
2010
15 years 3 months ago
2010
Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework an...
159
Voted
FORMATS
2010
Springer
15 years 1 months ago
2010
Springer
We study two-player timed games where the objectives of the two players are not opposite. We focus on the standard notion of Nash equilibrium and propose a series of transformation...
149
Voted
FORMATS
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Probabilistic timed automata are an extension of timed automata with discrete probability distributions. Simulation and bisimulation relations are widely-studied in the c...