7118 search results - page 1187 / 1424 » Electrical and Computer Engineering |
114
Voted
FOSSACS
2007
Springer
15 years 9 months ago
2007
Springer
We give logical characterizations of bisimulation relations for the probabilistic automata of Segala in terms of three Hennessy-Milner style logics. The three logics characterize s...
110
click to vote
FOSSACS
2007
Springer
15 years 9 months ago
2007
Springer
Desharnais, Gupta, Jagadeesan and Panangaden introduced a family of behavioural pseudometrics for probabilistic transition systems. These pseudometrics are a quantitative analogue ...
120
Voted
FSTTCS
2007
Springer
15 years 9 months ago
2007
Springer
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...
139
click to vote
FSTTCS
2007
Springer
15 years 9 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
114
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
In many design tasks it is difficult to explicitly define an objective function. This paper uses machine learning to derive an objective in a feature space based on selected examp...