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 6 of 6 for “"Map-coloring problem"”.

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

    A Constraint Satisfaction Problem (CSP) is a very powerful framework for representing and solving constraint problems. Many real world computational problems in Artificial Intelligence and other areas of computer science can be formulated as CSPs. Problems such as scheduling and timetabling in …

    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

    … has been known to be one of the most important problems to be solved in the process of functional decomposition of discrete functions. A lot of research has been done in this field with many new heuristics generated to find the column multiplicity, but there has not been an evaluation of the …

    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)