2588 search results - page 185 / 518 » Applications of Kolmogorov complexity to computable model th... |
118
click to vote
ACG
2009
Springer
15 years 8 months ago
2009
Springer
Evaluating agents in decision-making applications requires assessing their skill and predicting their behaviour. Both are well developed in Poker-like situations, but less so in mo...
123
click to vote
CONCUR
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...
LATA
2009
Springer
15 years 8 months ago
2009
Springer
In this paper we investigate the computational complexity of knot theoretic problems and show upper and lower bounds for planarity problem of signed and unsigned knot diagrams repr...
224
click to vote
ESOP
2004
Springer
15 years 7 months ago
2004
Springer
The Ambient calculus is a successful model of distributed, mobile computation, and has been the vehicle of new ideas for resource access control. Mobility types have been used to e...
117
click to vote
FDL
2006
IEEE
15 years 8 months ago
2006
IEEE
Future mobile devices will be based on heterogeneous multiprocessing platforms accommodating several currently stand-alone applications. Increasing complexity of both application ...