Search results

Jump to navigation Jump to search
Results 1 – 21 of 2,444
Advanced search

Search in namespaces:

View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • [[File:Vacuum World.tif|thumb|Vacuum World, a [[shortest path problem]] in which the goal is to vacuum up all the pieces of dirt]] ...m is useful to test and demonstrate methodologies. Researchers can use toy problems to compare the performance of different [[algorithm]]s. They are also good ...
    3 KB (429 words) - 08:46, 9 March 2025
  • ...the optimal solution, while others may only return the best solution found in the part of the state space that was explored. ...h problems include solving the [[eight queens puzzle]] or evaluating moves in games with a large [[game tree]], such as [[reversi]] or [[chess]]. ...
    3 KB (375 words) - 19:42, 19 July 2024
  • *In mathematical optimization and computer science, the set of all possible poi *In artificial intelligence search algorithms, the [[feasible region]] defining the set of all possible ...
    728 bytes (102 words) - 16:44, 3 October 2023
  • | name = Dalle Molle Institute for Artificial Intelligence | purpose = [[artificial intelligence]] research ...
    5 KB (554 words) - 18:56, 26 May 2025
  • ...ructured datasets]], interact with human beings, and adapt to new types of problems without too much human-guided training or interventions.<ref>{{cite web|tit ...on (RPA) involves the deployment of attended or unattended software agents in an organization's environment. These software agents, or robots, are progra ...
    5 KB (634 words) - 18:42, 24 May 2025
  • ...born 27 June 1961) is a professor of [[computer science]] and [[artificial intelligence]] at the [[University of Sussex]]. He is head of the Evolutionary and Adapt Husbands's research interests are in long-term investigations of artificial evolution of [[nervous system]]s for [[robot]]s, with emphasis on: ...
    3 KB (361 words) - 22:46, 27 April 2025
  • '''ASR-complete''' is, by analogy to "[[NP-completeness]]" in complexity theory, a term to indicate that the difficulty of a computationa Such problems are hypothesised to include: ...
    1 KB (159 words) - 22:25, 27 April 2024
  • ...of the game ''[[Focus (board game)|Focus]]'' by [[Sid Sackson]], published in ''[[A Gamut of Games]]''. The Annual ''Death Stacks'' [[Tournament]] is held in [[Charlotte, North Carolina|Charlotte]], [[North Carolina]] each summer and ...
    4 KB (537 words) - 02:30, 3 June 2024
  • {{Short description|Computer program created in 1959}} ...009">{{cite book|author=[[Nils J. Nilsson]]|title=The Quest for Artificial Intelligence|url=https://books.google.com/books?id=nUJdAAAAQBAJ|date=30 October 2009|pub ...
    4 KB (581 words) - 22:30, 27 November 2024
  • {{Short description|Artificial intelligence control techniques}} ...s that use various [[artificial intelligence]] computing approaches like [[artificial neural networks|neural networks]], [[Bayesian probability]], [[fuzzy logic] ...
    4 KB (559 words) - 16:41, 7 June 2025
  • | name = Artificial Intelligence: A Modern Approach | image = File:Artificial Intelligence- A Modern Approach.jpg ...
    7 KB (869 words) - 12:24, 13 April 2025
  • ...the [[Chinese University of Hong Kong]] (1977), and an [[MSc]] and [[PhD]] in [[Computer Science]] from the [[University of Essex]] (1983 and 1987). Prio years in various positions in the commercial sector in Hong Kong. ...
    4 KB (551 words) - 15:39, 17 March 2025
  • {{about|the general concept in computer science research|the sandbox video game|Blocksworld}} {{short description|Toy problem in artificial intelligence research}} ...
    5 KB (715 words) - 17:06, 7 June 2025
  • ...to technical problems reformulation was introduced by [[G. S. Altshuller]] in [[ARIZ]].<ref>{{cite journal |last1=Marconi |first1=Janice |title=ARIZ : Th * [[Artificial intelligence]] ...
    2 KB (174 words) - 16:25, 18 April 2025
  • {{Short description|Artificial neural network-based expert systems}} .... Apart from that, rough [[set theory]] may be used for encoding knowledge in the weights better and also [[genetic algorithms]] may be used to optimize ...
    2 KB (295 words) - 19:31, 12 August 2023
  • ...n [[Marvin Minsky]]'s essay K-lines: A Theory of Memory, published in 1980 in the journal ''Cognitive Science'': ...t idea. This should make it relatively easy for you to solve new, similar problems!" (1998, p. 82.) ...
    4 KB (566 words) - 00:45, 28 May 2025
  • ...field of [[computer science]], including [[artificial intelligence]] (AI), in which successive [[Configuration graph|configurations]] or ''states'' of an ...e space]], a [[set (mathematics)|set]] of ''states'' that a problem can be in. The set of states forms a [[Graph (discrete mathematics)|graph]] where two ...
    4 KB (541 words) - 07:05, 18 May 2025
  • ...orithm]]s to solve [[Boolean_satisfiability_problem|Boolean satisfiability problems]]. ...then repeated until all the clauses are satisfied. WalkSAT and GSAT differ in the methods used to select which variable to flip. ...
    5 KB (657 words) - 21:27, 3 July 2024
  • ...ime, CADUCEUS was described as the "most knowledge-intensive expert system in existence".<ref>The Fifth Generation. [[Edward A. Feigenbaum]] and [[Pamela ...Eric |title=Computer as consultant: Application of artificial intelligence in diagnosis |journal=Postgraduate Medicine |date=February 1984 |volume=75 |is ...
    4 KB (530 words) - 08:39, 20 December 2024
  • ...deals with a number of topics including [[perceptron]]s) credits the ideas in it to a group including M. N. Vaintsvaig, V. V. Maksimov, and M. S. Smirnov ...', [[Douglas Hofstadter]], Twentieth anniversary Edition, 1999, Artificial Intelligence: Prospects, p. 662</ref> ...
    6 KB (793 words) - 04:08, 19 May 2025
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)