845 search results - page 44 / 169 » Connecting Many-Sorted Theories |
CIE
2008
Springer
14 years 25 days ago
2008
Springer
We study perfectly locally computable structures, which are (possibly uncountable) structures S that have highly effective presentations of their local properties. We show that eve...
GG
2004
Springer
14 years 4 months ago
2004
Springer
There would seem to be a natural connection between graphs and information security. This is particularly so in the arena of access control and authorization. Research on applying ...
KDD
2008
ACM
14 years 11 months ago
2008
ACM
The vast majority of earlier work has focused on graphs which are both connected (typically by ignoring all but the giant connected component), and unweighted. Here we study numer...
ICALP
2004
Springer
14 years 4 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
ISMVL
2010
IEEE
14 years 3 months ago
2010
IEEE
Abstract—The paper studies graded properties of MTL valued binary connectives, focusing on conjunctive connectives such as t-norms, uninorms, aggregation operators, or quasicopul...