Sciweavers

5128 search results - page 238 / 1026
» When Abstraction Fails
Sort
View
AIIA
2003
Springer
16 years 15 days ago
A Complete Subsumption Algorithm
Abstract. Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to be used in real environments, both on their own and as a component of ...
Stefano Ferilli, Nicola Di Mauro, Teresa Maria Alt...
COLT
2006
Springer
15 years 11 months ago
Continuous Experts and the Binning Algorithm
Abstract. We consider the design of online master algorithms for combining the predictions from a set of experts where the absolute loss of the master is to be close to the absolut...
Jacob Abernethy, John Langford, Manfred K. Warmuth
CORR
2006
Springer
100views Education» more  CORR 2006»
15 years 7 months ago
Capacity of Cooperative Fusion in the Presence of Byzantine Sensors
Abstract-- The problem of cooperative fusion in the presence of both Byzantine sensors and misinformed sensors is considered. An information theoretic formulation is used to charac...
Oliver Kosut, Lang Tong
SCIENTOMETRICS
2010
122views more  SCIENTOMETRICS 2010»
15 years 5 months ago
A comparison of bibliometric indicators for computer science scholars and journals on Web of Science and Google Scholar
Abstract. Given the current availability of different bibliometric indicators and of production and citation data sources, the following two questions immediately arise: do the in...
Massimo Franceschet
ECSQARU
2009
Springer
15 years 5 months ago
Can the Minimum Rule of Possibility Theory Be Extended to Belief Functions?
Abstract. When merging belief functions, Dempster rule of combination is justified only when sources can be considered as independent. When dependencies are ill-known, it is usual ...
Sébastien Destercke, Didier Dubois