4865 search results - page 757 / 973 » The Complexity of Graph Connectivity |
153
click to vote
ESA
1998
Springer
15 years 8 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
152
click to vote
AGP
1994
IEEE
15 years 8 months ago
1994
IEEE
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
163
click to vote
SRDS
1993
IEEE
15 years 8 months ago
1993
IEEE
We propose a simple and practical probabilistic comparison-based model, employing multiple incomplete test concepts, for handling fault location in distributed systems using a Bay...
122
click to vote
EKAW
2000
Springer
15 years 8 months ago
2000
Springer
The goal of conceptual clustering is to build a set of embedded classes, which cluster objects based on their similarities. Knowledge organization aims at generating the set of mos...
168
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...