4865 search results - page 590 / 973 » The Complexity of Graph Connectivity |
181
click to vote
GI
2004
Springer
16 years 6 days ago
2004
Springer
: With the growing complexity of parallel architectures, the probability of system failures grows, too. One approach to cope with this problem is the self-healing, one of the organ...
169
click to vote
RELMICS
1998
Springer
15 years 11 months ago
1998
Springer
We present a class of polymodal logics for which the set of terms indexing the modal connectives can be hierarchized in two levels: the set of Boolean terms and the set of terms b...
163
click to vote
ISPW
1994
IEEE
15 years 11 months ago
1994
IEEE
I consider the problems of process system architecture in the context of the Perry-Wolf model of software architecture: process elements are executed in process systems by both ma...
210
click to vote
COCO
1993
Springer
15 years 11 months ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
177
click to vote
AUSAI
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we generalize our formal approach to modelling PRS agents away from PRS-specific assumptions to more general theories of rationality, while not losing the concretene...