Why Visualization is an AI-complete Problem (and Why That Matters)

2016 ◽  
Author(s):  
Randy Goebel
Keyword(s):  
Complete Problem

Sharing of Knowledge and Problem Solving When Teammates Have Diverse Hearing Status

2021 ◽  
pp. 104649642110102
Author(s):  
Michael Stinson ◽  
Lisa B. Elliot ◽  
Carol Marchetti ◽  
Daniel J. Devor ◽  
Joan R. Rentsch
Keyword(s):  
Problem Solving ◽  
Hard Of Hearing ◽  
The Other ◽  
Postsecondary Students ◽  
Problem Solution ◽  
Group Problem ◽  
Team Members ◽  
Group Problem Solving ◽  
Complete Problem ◽  
Hearing Status

This study examined knowledge sharing and problem solving in teams that included teammates who were deaf or hard of hearing (DHH). Eighteen teams of four students were comprised of either all deaf or hard of hearing (DHH), all hearing, or two DHH and two hearing postsecondary students who participated in group problem-solving. Successful problem solution, recall, and recognition of knowledge shared by team members were assessed. Hearing teams shared the most team knowledge and achieved the most complete problem solutions, followed by the mixed DHH/hearing teams. DHH teams did not perform as well as the other two types of teams.

scholarly journals Statistical mechanics of an NP-complete problem: subset sum

2001 ◽  
Vol 34 (44) ◽  
pp. 9555-9567 ◽  
Author(s):  
Tomohiro Sasamoto ◽  
Taro Toyoizumi ◽  
Hidetoshi Nishimori
Keyword(s):  
Statistical Mechanics ◽  
Complete Problem ◽  
Subset Sum ◽  
Np Complete

scholarly journals The Computational Complexity of Probabilistic Planning

1998 ◽  
Vol 9 ◽  
pp. 1-36 ◽  
Author(s):  
M. L. Littman ◽  
J. Goldsmith ◽  
M. Mundhenk
Keyword(s):  
Computational Complexity ◽  
Efficient Algorithms ◽  
Boolean Satisfiability ◽  
Complexity Classes ◽  
Probabilistic Planning ◽  
Plan Evaluation ◽  
Partially Ordered ◽  
Boolean Satisfiability Problem ◽  
Complete Problem ◽  
Planning Problems

We examine the computational complexity of testing and finding small plans in probabilistic planning domains with both flat and propositional representations. The complexity of plan evaluation and existence varies with the plan type sought; we examine totally ordered plans, acyclic plans, and looping plans, and partially ordered plans under three natural definitions of plan value. We show that problems of interest are complete for a variety of complexity classes: PL, P, NP, co-NP, PP, NP^PP, co-NP^PP, and PSPACE. In the process of proving that certain planning problems are complete for NP^PP, we introduce a new basic NP^PP-complete problem, E-MAJSAT, which generalizes the standard Boolean satisfiability problem to computations involving probabilistic quantities; our results suggest that the development of good heuristics for E-MAJSAT could be important for the creation of efficient algorithms for a wide variety of problems.

scholarly journals Consecutive Colouring of Oriented Graphs

2021 ◽  
Vol 76 (4) ◽  
Author(s):  
Marta Borowiecka-Olszewska ◽  
Ewa Drgas-Burchardt ◽  
Nahid Yelene Javier-Nol ◽  
Rita Zuazua
Keyword(s):  
Planar Graphs ◽  
Maximum Degree ◽  
Bipartite Graphs ◽  
Complete Graphs ◽  
Oriented Graphs ◽  
Complete Problem ◽  
Np Complete

AbstractWe consider arc colourings of oriented graphs such that for each vertex the colours of all out-arcs incident with the vertex and the colours of all in-arcs incident with the vertex form intervals. We prove that the existence of such a colouring is an NP-complete problem. We give the solution of the problem for r-regular oriented graphs, transitive tournaments, oriented graphs with small maximum degree, oriented graphs with small order and some other classes of oriented graphs. We state the conjecture that for each graph there exists a consecutive colourable orientation and confirm the conjecture for complete graphs, 2-degenerate graphs, planar graphs with girth at least 8, and bipartite graphs with arboricity at most two that include all planar bipartite graphs. Additionally, we prove that the conjecture is true for all perfect consecutively colourable graphs and for all forbidden graphs for the class of perfect consecutively colourable graphs.

An experimental evaluation and guideline for path finding in weighted dynamic network

2021 ◽  
Vol 14 (11) ◽  
pp. 2127-2140
Author(s):  
Mengxuan Zhang ◽  
Lei Li ◽  
Xiaofang Zhou
Keyword(s):  
Shortest Path ◽  
State Of The Art ◽  
Dynamic Networks ◽  
Real Life ◽  
Dynamic Network ◽  
Problem Space ◽  
Network Applications ◽  
Complete Problem ◽  
Path Computation ◽  
Shortest Path Computation

Shortest path computation is a building block of various network applications. Since real-life networks evolve as time passes, the Dynamic Shortest Path (DSP) problem has drawn lots of attention in recent years. However, as DSP has many factors related to network topology, update patterns, and query characteristics, existing works only test their algorithms on limited situations without sufficient comparisons with other approaches. Thus, it is still hard to choose the most suitable method in practice. To this end, we first identify the determinant dimensions and constraint dimensions of the DSP problem and create a complete problem space to cover all possible situations. Then we evaluate the state-of-the-art DSP methods under the same implementation standard and test them systematically under a set of synthetic dynamic networks. Furthermore, we propose the concept of dynamic degree to classify the dynamic environments and use throughput to evaluate their performance. These results can serve as a guideline to find the best solution for each situation during system implementation and also identify research opportunities. Finally, we validate our findings on real-life dynamic networks.

Sign in / Sign up

Export Citation Format

Share Document