91 search results - page 5 / 19 » On the Polynomial Transparency of Resolution |
ESA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We study the problem of contention resolution for differentsized jobs on a simple channel. When a job makes a run attempt, it learns only whether the attempt succeeded or...
SIAMCOMP
2000
13 years 7 months ago
2000
An exponential lower bound for the size of tree-like cutting planes refutations of a certain family of conjunctive normal form (CNF) formulas with polynomial size resolution refuta...
EPIA
1993
Springer
13 years 11 months ago
1993
Springer
Abstract. This work presents a constraint solver for the domain of rational trees. Since the problem is NP-hard the strategy used by the solver is to reduce as much as possible, in...
ENVSOFT
2006
13 years 7 months ago
2006
Knowledge of land surface water, energy, and carbon conditions are of critical importance due to their impact on many real world applications such as agricultural production, wate...
ER
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. To integrate information, data in different formats, from different, potentially overlapping sources, must be related and transformed to meet the users' needs. Ten y...