1686 search results - page 30 / 338 » Programs as polygraphs: computability and complexity |
93
Voted
ENTCS
2006
14 years 9 months ago
2006
High performance scientific computing software is of critical international importance as it supports scientific explorations and engineering. Software development in this area is...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...
77
Voted
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fal...
ICS
2001
Tsinghua U.
15 years 2 months ago
2001
Tsinghua U.
The issue logic of dynamically scheduled superscalar processors is one of their most complex and power-consuming parts. In this paper we present alternative issue-logic designs th...