520 search results - page 56 / 104 » Subset Counting in Trees |
132
click to vote
FROCOS
2009
Springer
15 years 6 months ago
2009
Springer
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
IJCAI
2003
15 years 1 months ago
2003
We present an approach for learning part-of-speech distinctions by induction over the lexicon of the Cyc knowledge base. This produces good results (74.6%) using a decision tree t...
105
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
108
click to vote
TVLSI
2008
14 years 11 months ago
2008
Abstract--In this paper, we introduce a novel substrate noise estimation technique during early floorplanning for mixed signal system-on-chip (SOC), based on block preference direc...