3008 search results - page 406 / 602 » Independence in connected graphs |
176
click to vote
AIPS
1996
15 years 8 months ago
1996
An increasing number of planners can handle uncertainty in the domain or in action outcomes. However, less work has addressed building plans when the planner's world can chan...
172
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
In this paper, we explore the use of a Gaussian posteriorgram based representation for unsupervised discovery of speech patterns. Compared with our previous work, the new approach...
118
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...
162
click to vote
JCT
2008
15 years 7 months ago
2008
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
187
click to vote
CORR
2007
Springer
15 years 7 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 ...