Sciweavers

228 search results - page 24 / 46
» An effective theory of type refinements
Sort
View
SIGMOD
1999
ACM
94views Database» more  SIGMOD 1999»
14 years 5 days ago
Logical Logging to Extend Recovery to New Domains
Recovery can be extended to new domains at reduced logging cost by exploiting "logical" log operations. During recovery, a logical log operation may read data values fro...
David B. Lomet, Mark R. Tuttle
CORR
2010
Springer
104views Education» more  CORR 2010»
13 years 8 months ago
Empirical learning aided by weak domain knowledge in the form of feature importance
Standard hybrid learners that use domain knowledge require stronger knowledge that is hard and expensive to acquire. However, weaker domain knowledge can benefit from prior knowle...
Ridwan Al Iqbal
CORR
2011
Springer
160views Education» more  CORR 2011»
13 years 2 months ago
When is social computation better than the sum of its parts?
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
Vadas Gintautas, Aric A. Hagberg, Luís M. A...
PEPM
2010
ACM
14 years 4 months ago
Making "stricterness" more relevant
Adapting a strictness analyser to have it take into account explicit strictness annotations can be a tricky business. Straightforward extensions of analyses based on relevance typ...
Stefan Holdermans, Jurriaan Hage
KR
2004
Springer
14 years 1 months ago
Updating of a Possibilistic Knowledge Base by Crisp or Fuzzy Transition Rules
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
Boris Mailhé, Henri Prade