3729 search results - page 651 / 746 » On Formal Modeling of Agent Computations |
174
click to vote
CAD
1999
Springer
15 years 6 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...
172
click to vote
CONSTRAINTS
2010
15 years 3 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 ...
167
click to vote
STOC
1993
ACM
15 years 10 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...
188
click to vote
EUSFLAT
2007
15 years 7 months ago
2007
At present time configurable wireless sensor networks are given special consideration. Wireless sensor networks are now a static elements union. To make such a network a powerful ...
182
click to vote
AINA
2009
IEEE
16 years 1 months ago
2009
IEEE
—The WebInVivo project aims at providing automated support for clinical research on neglected diseases. It includes mechanisms for (a) sharing and reusing clinical trial assets, ...