Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Canadian_traveller_problem> ?p ?o }
Showing triples 1 to 48 of
48
with 100 triples per page.
- Canadian_traveller_problem abstract "In computer science and graph theory, the Canadian Traveller Problem (CTP) is a generalization of the shortest path problem to graphs that are partially observable. In other words, the graph is revealed while it is being explored, and explorative edges are charged even if they do not contribute to the final path.This optimization problem was introduced by Christos Papadimitriou and Mihalis Yannakakis in 1989 and a number of variants of the problem have been studied since. The name supposedly originates from conversations of the authors who learned of the difficulty Canadian drivers had with snowfall randomly blocking roads. The stochastic version, where each edge is associated with a probability of independently being in the graph, has been given considerable attention in operations research under the name \"the Stochastic Shortest Path Problem with Recourse\" (SSPPR).".
- Canadian_traveller_problem wikiPageID "18210373".
- Canadian_traveller_problem wikiPageLength "10732".
- Canadian_traveller_problem wikiPageOutDegree "30".
- Canadian_traveller_problem wikiPageRevisionID "693034994".
- Canadian_traveller_problem wikiPageWikiLink APX.
- Canadian_traveller_problem wikiPageWikiLink A_priori_and_a_posteriori.
- Canadian_traveller_problem wikiPageWikiLink Artificial_intelligence.
- Canadian_traveller_problem wikiPageWikiLink Best,_worst_and_average_case.
- Canadian_traveller_problem wikiPageWikiLink Category:Computational_problems_in_graph_theory.
- Canadian_traveller_problem wikiPageWikiLink Category:Operations_research.
- Canadian_traveller_problem wikiPageWikiLink Category:PSPACE-complete_problems.
- Canadian_traveller_problem wikiPageWikiLink Christos_Papadimitriou.
- Canadian_traveller_problem wikiPageWikiLink Competitive_analysis_(online_algorithm).
- Canadian_traveller_problem wikiPageWikiLink Computer_science.
- Canadian_traveller_problem wikiPageWikiLink Game_theory.
- Canadian_traveller_problem wikiPageWikiLink Glossary_of_graph_theory.
- Canadian_traveller_problem wikiPageWikiLink Graph_theory.
- Canadian_traveller_problem wikiPageWikiLink Graph_traversal.
- Canadian_traveller_problem wikiPageWikiLink Hitting_time.
- Canadian_traveller_problem wikiPageWikiLink Machine_learning.
- Canadian_traveller_problem wikiPageWikiLink Mihalis_Yannakakis.
- Canadian_traveller_problem wikiPageWikiLink Operations_research.
- Canadian_traveller_problem wikiPageWikiLink Optimization_problem.
- Canadian_traveller_problem wikiPageWikiLink PSPACE-complete.
- Canadian_traveller_problem wikiPageWikiLink Power_set.
- Canadian_traveller_problem wikiPageWikiLink Sharp-P.
- Canadian_traveller_problem wikiPageWikiLink Shortest_path_problem.
- Canadian_traveller_problem wikiPageWikiLink Springer_Science+Business_Media.
- Canadian_traveller_problem wikiPageWikiLinkText "Canadian traveller problem".
- Canadian_traveller_problem wikiPageUsesTemplate Template:Cite_conference.
- Canadian_traveller_problem wikiPageUsesTemplate Template:Cite_paper.
- Canadian_traveller_problem wikiPageUsesTemplate Template:Reflist.
- Canadian_traveller_problem subject Category:Computational_problems_in_graph_theory.
- Canadian_traveller_problem subject Category:Operations_research.
- Canadian_traveller_problem subject Category:PSPACE-complete_problems.
- Canadian_traveller_problem hypernym Generalization.
- Canadian_traveller_problem type Discipline.
- Canadian_traveller_problem type Field.
- Canadian_traveller_problem type Redirect.
- Canadian_traveller_problem comment "In computer science and graph theory, the Canadian Traveller Problem (CTP) is a generalization of the shortest path problem to graphs that are partially observable. In other words, the graph is revealed while it is being explored, and explorative edges are charged even if they do not contribute to the final path.This optimization problem was introduced by Christos Papadimitriou and Mihalis Yannakakis in 1989 and a number of variants of the problem have been studied since.".
- Canadian_traveller_problem label "Canadian traveller problem".
- Canadian_traveller_problem sameAs Q5030897.
- Canadian_traveller_problem sameAs مسئله_مسافر_کانادایی.
- Canadian_traveller_problem sameAs m.04ctl_b.
- Canadian_traveller_problem sameAs Q5030897.
- Canadian_traveller_problem wasDerivedFrom Canadian_traveller_problem?oldid=693034994.
- Canadian_traveller_problem isPrimaryTopicOf Canadian_traveller_problem.