828 search results - page 4 / 166 » Bounded Hairpin Completion |
ATAL
2004
Springer
15 years 2 months ago
2004
Springer
We propose a context-logic style formalism, Timed Reasoning Logics (TRL), to describe resource-bounded reasoners who take time to derive consequences of their knowledge. The seman...
73
Voted
VMCAI
2004
Springer
15 years 2 months ago
2004
Springer
ISTCS
1997
Springer
15 years 1 months ago
1997
Springer
UAI
2004
14 years 11 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...