1242 search results - page 119 / 249 » A Computational Complexity Theory in Membrane Computing |
135
click to vote
SCHOLARPEDIA
2011
14 years 23 days ago
2011
: In 1613 d’Aguilon published a book on optics containing a novel color mixture diagram in arc form. Diagrams of similar form are found in many medieval manuscripts where they ha...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
129
click to vote
GECCO
2011
Springer
14 years 1 months ago
2011
Springer
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...
101
click to vote
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
103
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
In the algebraic theory of codes and formal languages, the set Q of all primitive words over some alphabet Σ has received special interest. With this survey article we give an ove...