122 search results - page 6 / 25 » Light types for polynomial time computation in lambda-calcul... |
MCU
2007
13 years 9 months ago
2007
We review some results about the computational power of several computational models. Considered models have in common to be related to continuous dynamical systems. 1 Dynamical Sy...
ESOP
2012
Springer
12 years 3 months ago
2012
Springer
Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in character...
ATAL
2011
Springer
12 years 7 months ago
2011
Springer
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Thus, coalitional games, including Coalition Structure Generation (CSG), have been ...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Focused around the field of the exploitation and the administration of high performance large-scale parallel systems , this article describes the work carried out on the deployme...
22
Voted
SIGECOM
2004
ACM
14 years 27 days ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...