Sciweavers

17366 search results - page 36 / 3474
» New Revision Algorithms
Sort
View
ATAL
2008
Springer
13 years 11 months ago
On k-optimal distributed constraint optimization algorithms: new bounds and algorithms
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...
Emma Bowring, Jonathan P. Pearce, Christopher Port...
JGAA
2007
135views more  JGAA 2007»
13 years 9 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
COLING
1994
13 years 11 months ago
Structure Sharing Problem And Its Solution In Graph Unification
The revised graph unification algorithms presented here are more efficient because they reduce the amount of copying that was necessary because of the assumption that data-structu...
Kiyoshi Kogure
AUSAI
1999
Springer
14 years 2 months ago
Minimal Belief Change and Pareto-Optimality
This paper analyzes the notion of a minimal belief change that incorporates new information. I apply the fundamental decisiontheoretic principle of Pareto-optimality to derive a no...
Oliver Schulte