1026 search results - page 24 / 206 » On Finding Minimal w-cutset |
ASWC
2008
Springer
13 years 11 months ago
2008
Springer
Finding the justifications for an entailment (i.e., minimal sets of axioms responsible for it) is a prominent reasoning service in ontology engineering, as justifications facilitat...
EMNLP
2008
13 years 10 months ago
2008
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
ICCNMC
2005
Springer
14 years 2 months ago
2005
Springer
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
COMCOM
2006
13 years 9 months ago
2006
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...