2713 search results - page 32 / 543 » Parameterized Tree Systems |
MFCS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
IWPEC
2009
Springer
14 years 4 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
NAACL
2010
13 years 7 months ago
2010
Recent work has proposed the use of an extracted tree grammar as the basis for treebank analysis and search queries, in which queries are stated over the elementary trees, which a...
VMCAI
2004
Springer
14 years 3 months ago
2004
Springer
The method of Invisible Invariants was developed originally in order to verify safety properties of parameterized systems fully automatically. Roughly speaking, the method is based...
WSC
2004
13 years 11 months ago
2004
Decision trees are one of the most easy to use tools in decision analysis. Problems where decision tree branches are based on random variables have not received much attention. Th...