922 search results - page 67 / 185 » On a Generalization of the Stone-Weierstrass Theorem |
176
click to vote
JCT
2010
15 years 4 months ago
2010
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all 3 ≤ ≤ n. Write α(G) for the independence numbe...
153
click to vote
TSP
2010
15 years 1 months ago
2010
This paper considers the downlink beamforming optimization problem that minimizes the total transmission power subject to global shaping constraints and individual shaping constrai...
191
click to vote
ISSTA
2012
ACM
13 years 8 months ago
2012
ACM
Recent research has suggested that a large class of software bugs fall into the category of inconsistencies, or cases where two pieces of program code make incompatible assumption...
293
click to vote
ACL2
2006
ACM
15 years 10 months ago
2006
ACM
We have extended the ACL2 theorem prover to automatically prove properties of VHDL circuits with IBM's Internal SixthSense verification system. We have used this extension to...
168
click to vote
PODC
2009
ACM
16 years 6 months ago
2009
ACM
In 2004, Klavins et al. introduced the use of graph grammars to describe--and to program--systems of self-assembly. It turns out that these graph grammars can be embedded in a gra...