231 search results - page 32 / 47 » The Number of Independent Sets in a Regular Graph |
FORMATS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...
WABI
2007
Springer
15 years 5 months ago
2007
Springer
In comparing genomic maps, it is often difficult to distinguish mapping errors and incorrectly resolved paralogies from genuine rearrangements of the genomes. A solution to this ...
113
click to vote
SETA
2004
Springer
15 years 5 months ago
2004
Springer
We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n =...
STOC
2009
ACM
15 years 6 months ago
2009
ACM
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
129
click to vote
PUK
2003
15 years 1 months ago
2003
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...