552 search results - page 12 / 111 » Observable Graphs |
APLAS
2005
ACM
14 years 1 months ago
2005
ACM
We present a simple algorithm for register allocation which is competitive with the iterated register coalescing algorithm of George and Appel. We base our algorithm on the observa...
ACTA
2006
13 years 8 months ago
2006
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural family of canonical infinite automata representing their...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
— Determining the optimal topology of a graph is pertinent to many domains, as graphs can be used to model a variety of systems. Evolutionary algorithms constitute a popular opti...
FCS
2006
13 years 9 months ago
2006
: In the complete graph K2m+3 for m 2, we study some structures of simple non-isomorphic Hamiltonian sub-graphs of the form H ( 2m+3 , 6m+3) for m 2 . The various structures of t...
CMOT
2004
13 years 8 months ago
2004
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...