105 search results - page 11 / 21 » Representing Trees of Higher Degree |
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
Representing agent policies compactly is essential for improving the scalability of multi-agent planning algorithms. In this paper, we focus on developing a pruning technique that...
BNCOD
2004
15 years 1 months ago
2004
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
JSAC
2007
14 years 11 months ago
2007
— Overlay-based multicast has been proposed as a key alternative for large-scale group communication. There is ample motivation for such an approach, as it delivers the scalabili...
JGAA
2010
14 years 10 months ago
2010
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that ca...
101
click to vote
WIA
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees o...