5699 search results - page 56 / 1140 » Alternating model trees |
FOSSACS
2007
Springer
15 years 5 months ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
CCR
1998
14 years 10 months ago
1998
Bandwidth-sensitive multicast delivery controlled by routing criteria pertinent to the actual traffic flow is very costly in terms of router state and control overhead and it scal...
GECCO
2004
Springer
15 years 4 months ago
2004
Springer
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
ESA
2009
Springer
15 years 2 months ago
2009
Springer
Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown tha...