2588 search results - page 211 / 518 » Applications of Kolmogorov complexity to computable model th... |
160
click to vote
STACS
2001
Springer
15 years 11 months ago
2001
Springer
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
143
click to vote
ENTCS
2007
15 years 6 months ago
2007
The first and the second author introduced reversible ccs (rccs) in order to model concurrent computations where certain actions are allowed to be reversed. Here we t the core of...
206
click to vote
HCI
2009
15 years 4 months ago
2009
As the demand for domain- and formalism-specific visual modelling environments grows, the need to rapidly construct complex User Interfaces (UIs) increases. In this paper, we propo...
178
click to vote
TIT
2010
15 years 1 months ago
2010
The work identifies the first general, explicit, and non-random MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT),...
187
click to vote
JACM
2007
15 years 6 months ago
2007
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...