1686 search results - page 227 / 338 » Programs as polygraphs: computability and complexity |
165
click to vote
DBSEC
1996
15 years 5 months ago
1996
High assurance security is di cult to achieve in distributed computer systems and databases because of their complexity, non-determinism and inherent heterogeneity. The practical ...
133
click to vote
DEDUCTIVE
1994
15 years 5 months ago
1994
Given an intensional database (IDB) and an extension database (EDB), the view update problem translates updates on the IDB into updates on the EDB. One approach to the view update...
104
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
In this paper we investigate the affect of various acceptance conditions on recogniser membrane systems without dissolution. We demonstrate that two particular acceptance conditio...
142
click to vote
CSJM
2006
15 years 4 months ago
2006
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...
148
click to vote
ARTMED
2002
15 years 3 months ago
2002
This paper presents an evolutionary artificial neural network approach based on the pareto differential evolution algorithm augmented with local search for the prediction of breas...