Sciweavers

4488 search results - page 208 / 898
» Properties of NP-Complete Sets
Sort
View
145
Voted
CORR
2004
Springer
115views Education» more  CORR 2004»
15 years 5 months ago
An Algorithm for Quasi-Associative and Quasi-Markovian Rules of Combination in Information Fusion
: In this paper one proposes a simple algorithm of combining the fusion rules, those rules which first use the conjunctive rule and then the transfer of conflicting mass to the non...
Florentin Smarandache, Jean Dezert
DAM
2000
86views more  DAM 2000»
15 years 5 months ago
A supertree method for rooted trees
Abstract. The amalgamation of leaf-labelled (phylogenetic) trees on overlapping leaf sets into one (super)tree is a central problem in several areas of classification, particularly...
Charles Semple, Mike A. Steel
MOC
2000
77views more  MOC 2000»
15 years 5 months ago
Ultraconvergence of the patch recovery technique II
The ultraconvergence property of a gradient recovery technique proposed by Zienkiewicz and Zhu is analyzed for the Laplace equation in the two dimensional setting. Under the assump...
Zhimin Zhang
SIAMJO
2000
61views more  SIAMJO 2000»
15 years 5 months ago
Stability of Locally Optimal Solutions
: Necessary and sufficient conditions are obtained for the Lipschitzian stability of local solutions to finite-dimensional parameterized optimization problems in a very general set...
A. B. Levy, R. A. Poliquin, R. Tyrell Rockafellar
ITA
2002
105views Communications» more  ITA 2002»
15 years 5 months ago
Polypodic codes
Word and tree codes are studied in a common framework, that of polypodes which are sets endowed with a substitution like operation. Many examples are given and basic properties are...
Symeon Bozapalidis, Olympia Louscou-Bozapalidou