Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Maze_runner> ?p ?o }
Showing triples 1 to 35 of
35
with 100 triples per page.
- Maze_runner abstract "Maze runner is a connection routing method that represents the entire routing space as a grid. Parts of this grid are blocked by components, specialised areas, or already present wiring. The grid size corresponds to the wiring pitch of the area. The goal is to find a chain of grid cells that go from point A to point B.A maze runner may use the Lee algorithm. It uses a wave propagation style (a wave are all cells that can be reached in n steps) throughout the routing space. The wave stops when the target is reached, and the path determined by backtracking through the cells.".
- Maze_runner wikiPageID "5717312".
- Maze_runner wikiPageLength "1240".
- Maze_runner wikiPageOutDegree "8".
- Maze_runner wikiPageRevisionID "650463196".
- Maze_runner wikiPageWikiLink Category:Electronic_design_automation.
- Maze_runner wikiPageWikiLink Category:Electronic_engineering.
- Maze_runner wikiPageWikiLink Category:Electronics_optimization.
- Maze_runner wikiPageWikiLink Computer_network.
- Maze_runner wikiPageWikiLink Electrical_wiring.
- Maze_runner wikiPageWikiLink Lee_algorithm.
- Maze_runner wikiPageWikiLink Routing.
- Maze_runner wikiPageWikiLink Wave_propagation.
- Maze_runner wikiPageWikiLink Wiring.
- Maze_runner wikiPageWikiLinkText "Maze runner".
- Maze_runner hasPhotoCollection Maze_runner.
- Maze_runner wikiPageUsesTemplate Template:About.
- Maze_runner wikiPageUsesTemplate Template:Citation.
- Maze_runner wikiPageUsesTemplate Template:Electronics-stub.
- Maze_runner wikiPageUsesTemplate Template:Refimprove.
- Maze_runner subject Category:Electronic_design_automation.
- Maze_runner subject Category:Electronic_engineering.
- Maze_runner subject Category:Electronics_optimization.
- Maze_runner hypernym Connection.
- Maze_runner type Article.
- Maze_runner type Road.
- Maze_runner type Article.
- Maze_runner type Discipline.
- Maze_runner comment "Maze runner is a connection routing method that represents the entire routing space as a grid. Parts of this grid are blocked by components, specialised areas, or already present wiring. The grid size corresponds to the wiring pitch of the area. The goal is to find a chain of grid cells that go from point A to point B.A maze runner may use the Lee algorithm. It uses a wave propagation style (a wave are all cells that can be reached in n steps) throughout the routing space.".
- Maze_runner label "Maze runner".
- Maze_runner sameAs m.0f0x12.
- Maze_runner sameAs Q6798413.
- Maze_runner sameAs Q6798413.
- Maze_runner wasDerivedFrom Maze_runner?oldid=650463196.
- Maze_runner isPrimaryTopicOf Maze_runner.