2024 search results - page 332 / 405 » A Formal Model of Multi-agent Computations |
121
click to vote
AAAI
1997
15 years 5 months ago
1997
In this paper, we propose a stochastic version of a general purpose functional programming language as a method of modeling stochastic processes. The language contains random choi...
133
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
The pressing need for efficient compression schemes for XML documents has recently been focused on stack computation [6, 9], and in particular calls for a formulation of informati...
145
click to vote
CAD
1999
Springer
15 years 3 months ago
1999
Springer
This paper is concerned with the mathematics and formal specification of "set-like" operations for the mixed dimension cellular objects of the Djinn Application Programm...
141
click to vote
CONSTRAINTS
2010
15 years 1 months ago
2010
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
137
click to vote
STOC
1993
ACM
15 years 7 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...