231 search results - page 29 / 47 » The Number of Independent Sets in a Regular Graph |
156
click to vote
AIPS
2000
15 years 7 months ago
2000
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
173
click to vote
INFOCOM
2008
IEEE
16 years 14 days ago
2008
IEEE
Abstract—Recent advances in computer technology and wireless communications have enabled the emergence of stream-based sensor networks. In such sensor networks, real-time data ar...
150
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
151
click to vote
JGT
2007
15 years 6 months ago
2007
: Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In th...
173
click to vote
AUSDM
2007
Springer
16 years 7 days ago
2007
Springer
To date, most association rule mining algorithms have assumed that the domains of items are either discrete or, in a limited number of cases, hierarchical, categorical or linear. ...