169 search results - page 32 / 34 » On the Number of t-Ary Trees with a Given Path Length |
FLAIRS
2004
13 years 9 months ago
2004
This study borrowed sequence analysis techniques from the genetic sciences and applied them to a similar problem in email filtering and web searching. Genre identification is the ...
SYNASC
2006
IEEE
14 years 1 months ago
2006
IEEE
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
ALMOB
2006
13 years 7 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
AAAI
2008
13 years 10 months ago
2008
Cooperative problem solving with resource constraints are important in practical multi-agent systems. Resource constraints are necessary to handle practical problems including dis...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...