187 search results - page 23 / 38 » The Number of Independent Sets in a Grid Graph |
IROS
2006
IEEE
14 years 2 months ago
2006
IEEE
Abstract— We describe a model for planar distributed assembly, in which agents move randomly and independently on a twodimensional grid, joining square blocks together to form a ...
JGT
2007
13 years 8 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...
AUSDM
2007
Springer
14 years 2 months 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. ...
ICASSP
2011
IEEE
13 years 14 days ago
2011
IEEE
A discretized version of a continuous optimization problem is considered for the case where data is obtained from a set of dispersed sensor nodes and the overall metric is a sum o...
ICCS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...