5964 search results - page 379 / 1193 » A theory of speculative computation |
250
click to vote
WMP
2000
15 years 11 months ago
2000
This paper is an attempt to summarize the basic elements of the multiset theory. We begin by describing multisets and the operations between them, then we present hybrid sets and t...
203
click to vote
FCT
1995
Springer
15 years 11 months ago
1995
Springer
The concatenable processes of a Petri net N can be characterized ly as the arrows of a symmetric monoidal category P[N]. Yet, this is only a partial axiomatization, since P[N] is b...
205
click to vote
GD
2009
Springer
15 years 10 months ago
2009
Springer
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
175
click to vote
DAGSTUHL
2008
15 years 9 months ago
2008
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
184
click to vote
ISMB
1993
15 years 9 months ago
1993
In the field of biotechnologyand medicineit is of interest to modeland simulate metabolicprocesses. The usual methods to model metabolic pathwaysare chemicaldescriptions anddiffer...