6562 search results - page 246 / 1313 » Noetherianity and Combination Problems |
167
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
This paper describes a system combining model-based and learning-based methods for automated reasoning in large theories, i.e. on a large number of problems that use many axioms, l...
168
click to vote
AIIA
2009
Springer
16 years 1 months ago
2009
Springer
This paper studies the following question: given an instance of the propositional satisfiability problem, a randomized satisfiability solver, and a cluster of n computers, what i...
194
click to vote
IFM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present a formal development in Event-B of a distributed topology discovery algorithm. Distributed topology discovery is at the core of several routing algorithms and ...
168
click to vote
DOLAP
2009
ACM
16 years 1 months ago
2009
ACM
In this paper, we investigate the problem of answering top-k queries via materialized views. We provide theoretical guarantees for the adequacy of a view to answer a top-k query, ...
172
click to vote
APSCC
2008
IEEE
16 years 1 months ago
2008
IEEE
—This paper examines the problem of predicting job runtimes by exploiting the properties of parameter sweeps. A new parameter sweep prediction framework GIPSy (Grid Information P...