Content deleted Content added
Removing link(s) to "International Computer Games Association": Article deleted per Wikipedia:Articles for deletion/International Computer Games Association. |
m Task 18 (cosmetic): eval 25 templates: hyphenate params (14×); |
||
Line 9:
The [[IJCAI Award for Research Excellence]] is a biannual award given at the [[IJCAI]] conference to researcher in [[artificial intelligence]] as a recognition of [[excellence]] of their career.
The 2011 [[Federal Virtual World Challenge]], advertised by The White House<ref name="White House Publication, Challenge.Gov Fact Sheet">{{cite web|url=http://www.whitehouse.gov/sites/default/files/microsites/ostp/challenge-gov-fact-sheet.pdf |publisher=Whitehouse.Gov |year=2010|
The Machine Intelligence Prize is awarded annually by the [[British Computer Society]] for progress towards machine intelligence.<ref>{{Cite web|url=http://www.bcs-sgai.org/micomp/|title=SGAI: BCS Machine Intelligence Competition|website=www.bcs-sgai.org}}</ref>
Line 33:
The [[Netflix Prize]] was a competition for the best [[collaborative filtering]] [[algorithm]] that predicts user ratings for [[film]]s, based on previous ratings. The competition was held by [[Netflix]], an online [[DVD]]-rental service{{Citation needed|date=March 2019}}. The prize was $1,000,000.
The Pittsburgh Brain Activity Interpretation Competition<ref>{{Cite web|url=http://www.ebc.pitt.edu/PBAIC.html|
The Face Recognition Grand Challenge (May 2004 to March 2006) aimed to promote and advance [[facial recognition system|face recognition technology]].<ref>{{Cite web |url=http://face.nist.gov/frgc/ |title=NIST Face Recognition Grand Challenge<!-- Bot generated title --> |access-date=2008-03-27 |archive-url=https://web.archive.org/web/20080410072057/http://face.nist.gov/frgc/ |archive-date=2008-04-10 |url-status=dead }}</ref>
Line 51:
The [[CADE ATP System Competition]] (CASC) is a yearly competition of fully automated theorem provers for classical first order logic associated with the [[Conference on Automated Deduction|CADE]] and [[IJCAR]] conferences. The competition was part of the [[Alan Turing Centenary Conference]] in 2012, with total prizes of 9000 GBP given by [[Google]].
The SUMO prize is an annual prize for the best open source ontology extension of the [[Suggested Upper Merged Ontology|Suggested Upper Merged Ontology (SUMO)]], a formal theory of terms and logical definitions describing the world.<ref>{{Cite web|url=http://www.adampease.org/OP/|
The [[Hutter Prize|Hutter Prize for Lossless Compression of Human Knowledge]] is a cash prize which rewards compression improvements on a specific 100 MB English text file. The prize awards 500 euros for each one percent improvement, up to €50,000. The organizers believe that text compression and AI are equivalent problems and 3 prizes were already given, at around € 2k.
The Cyc TPTP Challenge is a competition to develop reasoning methods for the [[Cyc]] comprehensive ontology and database of everyday common sense knowledge.<ref>{{cite web|url=http://www.opencyc.org/doc/tptp_challenge_problem_set|
The [[Eternity II]] challenge was a [[constraint satisfaction]] problem very similar to the [[Tetravex]] game. The objective is to lay 256 tiles on a 16x16 grid while satisfying a number of constraints. The problem is known to be [[NP-complete]].<ref>{{cite journal | doi = 10.1016/j.ipl.2006.04.010 | volume=99 | title=Tetravex is NP-complete | journal=Information Processing Letters | year=2006 | pages=171–174| arxiv=0903.1147 | last1=Takenaga | first1=Yasuhiko | last2=Walsh | first2=Toby | issue=5 }}</ref> The prize was US$2,000,000.<ref>http://uk.eternityii.com/competition-rules-eternity-2/</ref> The competition ended in December 2010.
Line 64:
The Ing Prize was a substantial money prize attached to the World [[Computer Go]] Congress, starting from 1985 and expiring in 2000. It was a graduated set of handicap challenges against young professional players with increasing prizes as the handicap was lowered. At the time it expired in 2000, the unclaimed prize was 400,000 NT dollars for winning a 9-stone handicap match.
The AAAI [[General Game Playing]] Competition is a competition to develop programs that are effective at [[General Game Playing|general game playing]].<ref>{{Cite web|url=http://games.stanford.edu/competition/competition.html|
The General Video Game AI Competition (GVGAI<ref>{{Cite web|url=http://www.gvgai.net/|title=The GVG-AI Competition|website=www.gvgai.net}}</ref>) poses the problem of creating artificial intelligence that can play a wide, and in principle unlimited, range of games. Concretely, it tackles the problem of devising an algorithm that is able to play any game it is given, even if the game is not known a priori. Additionally, the contests poses the challenge of creating level and rule generators for any game is given. This area of study can be seen as an approximation of General Artificial Intelligence, with very little room for game dependent heuristics. The competition runs yearly in different tracks: single player planning,<ref>{{Cite web|url=http://www.diego-perez.net/papers/GVGAI2014Competition.pdf|title=Single Player Planning GVGAI}}</ref> two-player planning,<ref>{{Cite web|url=http://www.diego-perez.net/papers/GVGAI20162PCompetition.pdf|title=Two-Player Planning GVGAI}}</ref> single player learning,<ref>{{Cite web|url=http://www.liujialin.tech/publications/GVGAISingleLearning_manual.pdf|title=Single Player Learning GVGAI}}</ref> level<ref>{{Cite web|url=http://www.diego-perez.net/papers/GVGLG.pdf|title=Level Generation GVGAI}}</ref> and rule<ref>{{Cite web|url=http://www.diego-perez.net/papers/GVGRuleGeneration.pdf|title=Rule Generation GVGAI}}</ref> generation, and each track prizes ranging from 200 to 500 US dollars for winners and runner-ups.
|