Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 7 of 7 for “"map coloring"”.

  1. Using Conflict and Support Counts for Variable and Value Ordering in CSPs

    … and timetabling in operations research, map-coloring problem and Boolean satisfiability are some of the examples that can be represented and solved with a CSP framework. Solving a CSP is about searching for a solution in a huge search space. Very often, much search efforts are wasted on …

    regina Repository record for Using Conflict and Support Counts for Variable and Value Ordering in CSPs (opens in a new tab) Download PDF for Using Conflict and Support Counts for Variable and Value Ordering in CSPs (opens in a new tab)

  2. Exploiting and/or Parallelism in Prolog

    … "query," is used for obtaining results, and the map coloring problem is also solved on different configurations and results are compared. To obtain results the goals and subgoals are assigned to different processors by creating a tree. These assignments and transferring of goals are simulated by …

    portland-state Repository record for Exploiting and/or Parallelism in Prolog (opens in a new tab)

  3. Measuring the utility of color ramps in earth system science disciplines : a study of continuous data symbology

    … of communicating information in continuous value maps using Earth system science visualizations in the digital environment. The research approach consisted of two parts. First, we investigated commonly-used color ramps employed across many disciplines and devised a method to test color ramp …

    msu Repository record for Measuring the utility of color ramps in earth system science disciplines : a study of continuous data symbology (opens in a new tab)

  4. The Column Multiplicity Problem in Decomposition of Functions and Relations

    … multiplicity, and to find out if an exact graph coloring is actually required or not. In order to investigate this problem of column multiplicity in functional decomposition, two graph coloring programs, and a multi-coloring program were written: one of the graph coloring programs is an exact …

    portland-state Repository record for The Column Multiplicity Problem in Decomposition of Functions and Relations (opens in a new tab)

  5. Multi-Colored Maps from False Color Separations: Kirtland Examples (1800-1900)

    … primary and secondary colors in producing color maps. It is relatively easy to print the primary colors of magenta, cyan, and yellow on photo paper. It is considerably more difficult to print the secondary colors of red, blue, green, orange, purple, seagreen, and leafgreen consistently.This …

    byu Repository record for Multi-Colored Maps from False Color Separations: Kirtland Examples (1800-1900) (opens in a new tab) Download PDF for Multi-Colored Maps from False Color Separations: Kirtland Examples (1800-1900) (opens in a new tab)

  6. Graph Theory for the Middle School.

    … Graph Families, Graph Operations, and Graph Coloring. It is written as a guide for middle school teachers to prepare teaching units on graph theory.

    etsu Repository record for Graph Theory for the Middle School. (opens in a new tab) Download PDF for Graph Theory for the Middle School. (opens in a new tab)