Sciweavers

11752 search results - page 81 / 2351
» Those
Sort
View
CORR
2004
Springer
115views Education» more  CORR 2004»
14 years 9 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
CCR
2002
81views more  CCR 2002»
14 years 9 months ago
Rationalizing key design decisions in the ATM user plane
Any technology requires some number of key design decisions. In the case of the ATM user plane, the choices to use fixed length, 53 byte cells and virtual connections were unortho...
Daniel B. Grossman
COMCOM
2002
93views more  COMCOM 2002»
14 years 9 months ago
Topology-informed Internet replica placement
Recently, several studies have looked into the problem of replicated server placement on the Internet. Some of those studies have demonstrated that there exists a replica placemen...
Pavlin Radoslavov, Ramesh Govindan, Deborah Estrin
CSL
2002
Springer
14 years 9 months ago
Designs, Disputes and Strategies
Ludics has been proposed by Girard as an abstract general approach to proof theory. We explain how its basic notions correspond to those of the "innocent strategy" apprao...
Claudia Faggian, Martin Hyland
DM
2002
89views more  DM 2002»
14 years 9 months ago
Fibrations of graphs
A fibration of graphs is a morphism that is a local isomorphism of in-neighbourhoods, much in the same way a covering projection is a local isomorphism of neighbourhoods. This pap...
Paolo Boldi, Sebastiano Vigna