1242 search results - page 174 / 249 » A Computational Complexity Theory in Membrane Computing |
SOFSEM
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. Formal methods based on the mathematical theory of partially ordered sets (i.e., posets) have been used in the database field for the modelling of spatial data since many...
109
click to vote
ATAL
1997
Springer
15 years 2 months ago
1997
Springer
Incorporating coalition formation algorithms into agent systems shall be advantageous due to the consequent increase in the overall quality of task performance. Coalition formatio...
STACS
1994
Springer
15 years 1 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
DAC
2007
ACM
15 years 1 months ago
2007
ACM
The number of features that are supported in modern multimedia devices is increasing faster than ever. Estimating the performance of such applications when they are running on sha...
ZUM
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. The notion of agents has provided a way of imbuing traditional computing systems with an extra degree of flexibility that allows them to be more resilient and robust in t...