Sciweavers

26354 search results - page 211 / 5271
» How we refactor, and how we know it
Sort
View
ATAL
2011
Springer
14 years 6 months ago
Reasoning about local properties in modal logic
In modal logic, when adding a syntactic property to an axiomatisation, this property will semantically become true in all models, in all situations, under all circumstances. For i...
Hans P. van Ditmarsch, Wiebe van der Hoek, Barteld...
IJAR
2006
103views more  IJAR 2006»
15 years 6 months ago
Computing mean and variance under Dempster-Shafer uncertainty: Towards faster algorithms
In many real-life situations, we only have partial information about the actual probability distribution. For example, under Dempster-Shafer uncertainty, we only know the masses m...
Vladik Kreinovich, Gang Xiang, Scott Ferson
EDBT
2006
ACM
103views Database» more  EDBT 2006»
16 years 6 months ago
Finding Equivalent Rewritings in the Presence of Arithmetic Comparisons
The problem of rewriting queries using views has received significant attention because of its applications in a wide variety of datamanagement problems. For select-project-join SQ...
Foto N. Afrati, Rada Chirkova, Manolis Gergatsouli...
ELPUB
2004
ACM
16 years 1 days ago
The need for sharing user-profiles in digital libraries
Personalization was a hype in the late 1990s. Several organizations offered (and are still offering) personalization services for their customers. From ecommerce applications we...
Harald Krottmaier
DSN
2004
IEEE
15 years 10 months ago
Robust Aggregation Protocols for Large-Scale Overlay Networks
Aggregation refers to a set of functions that provide global information about a distributed system. These functions operate on numeric values distributed over the system and can ...
Alberto Montresor, Márk Jelasity, Özal...