2944 search results - page 167 / 589 » Improving Bound Propagation |
121
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
106
click to vote
HASE
2007
IEEE
15 years 9 months ago
2007
IEEE
SyncProbe improves the end-to-end predictability of distributed systems by providing applications with a real-time estimate of the maximum expected message delay (upper bound on c...
110
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
239
click to vote
POPL
2009
ACM
16 years 3 months ago
2009
ACM
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...
116
click to vote
CPAIOR
2007
Springer
15 years 9 months ago
2007
Springer
In this paper, we investigate to which extent the elimination of a class of redundant clauses in SAT instances could improve the efficiency of modern satisfiability provers. Sinc...