This HTML5 document contains 41 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n19http://dbpedia.org/resource/File:
n22http://grammatical-evolution.org/
n15https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n14http://genetic-programming.org/
freebasehttp://rdf.freebase.com/ns/
n13https://archive.today/20110502154819/http:/pages.bangor.ac.uk/~eep201/jge/
n20http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/
n16http://www.lalena.com/AI/Ant/

Statements

Subject Item
dbr:Santa_Fe_Trail_problem
rdf:type
yago:Abstraction100002137 yago:Rule105846932 dbo:MilitaryConflict yago:YagoPermanentlyLocatedEntity yago:PsychologicalFeature100023100 yago:Activity100407535 yago:Algorithm105847438 yago:Procedure101023820 yago:Event100029378 yago:Act100030358 yago:WikicatGeneticAlgorithms
rdfs:label
Santa Fe Trail problem
rdfs:comment
The Santa Fe Trail problem is a genetic programming exercise in which artificial ants search for food pellets according to a programmed set of instructions. The layout of food pellets in the Santa Fe Trail problem has become a standard for comparing different genetic programming algorithms and solutions. One method for programming and testing algorithms on the Santa Fe Trail problem is by using the NetLogo application. There is at least one case of a student creating a Lego robotic ant to solve the problem.
foaf:depiction
n20:SantaFeTrail.gif
dcterms:subject
dbc:Genetic_programming dbc:Genetic_algorithms
dbo:wikiPageID
31726662
dbo:wikiPageRevisionID
1062853664
dbo:wikiPageWikiLink
dbr:Java_Grammatical_Evolution dbc:Genetic_programming dbr:Agent-based_model dbr:Artificial_ants dbc:Genetic_algorithms dbr:Genetic_programming dbr:NetLogo n19:SantaFeTrail.gif
dbo:wikiPageExternalLink
n13:index.html n14: n16: n22:
owl:sameAs
wikidata:Q7419571 n15:4uP5o freebase:m.0gmg65b yago-res:Santa_Fe_Trail_problem
dbp:wikiPageUsesTemplate
dbt:Reflist
dbo:thumbnail
n20:SantaFeTrail.gif?width=300
dbo:abstract
The Santa Fe Trail problem is a genetic programming exercise in which artificial ants search for food pellets according to a programmed set of instructions. The layout of food pellets in the Santa Fe Trail problem has become a standard for comparing different genetic programming algorithms and solutions. One method for programming and testing algorithms on the Santa Fe Trail problem is by using the NetLogo application. There is at least one case of a student creating a Lego robotic ant to solve the problem.
gold:hypernym
dbr:Exercise
prov:wasDerivedFrom
wikipedia-en:Santa_Fe_Trail_problem?oldid=1062853664&ns=0
dbo:wikiPageLength
1576
foaf:isPrimaryTopicOf
wikipedia-en:Santa_Fe_Trail_problem