108 search results - page 16 / 22 » iandc 2006 |
IANDC
2006
14 years 9 months ago
2006
We study several algebras of graphs and hypergraphs and the corresponding notions of equational sets and recognizable sets. We generalize and unify several existing results which ...
IANDC
2006
14 years 9 months ago
2006
It is well-known that stable models (as dI-domains, qualitative domains and coherence are not fully abstract for the language PCF. This fact is related to the existence of stable ...
IANDC
2006
14 years 9 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
101
click to vote
IANDC
2006
14 years 9 months ago
2006
Probabilistic verification of continuous-time stochastic processes has received increasing attention in the model-checking community in the past five years, with a clear focus on ...
IANDC
2006
14 years 9 months ago
2006
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We...