When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Card sorting - Wikipedia

    en.wikipedia.org/wiki/Card_sorting

    Card sorting is a technique in user experience design in which a person tests a group of subject experts or users to generate a dendrogram (category tree) or folksonomy. It is a useful approach for designing information architecture , workflows, menu structure, or web site navigation paths.

  3. Hospital information system - Wikipedia

    en.wikipedia.org/wiki/Hospital_information_system

    A hospital information system (HIS) is an element of health informatics that focuses mainly on the administrational needs of hospitals.In many implementations, a HIS is a comprehensive, integrated information system designed to manage all the aspects of a hospital's operation, such as medical, administrative, financial, and legal issues and the corresponding processing of services.

  4. Punched card sorter - Wikipedia

    en.wikipedia.org/wiki/Punched_card_sorter

    A punched card sorter is a machine for sorting decks of punched cards. Sorting was a major activity in most facilities that processed data on punched cards using unit record equipment . The work flow of many processes required decks of cards to be put into some specific order as determined by the data punched in the cards.

  5. File : Multiple Classification Card Sorting Task 3.jpg

    en.wikipedia.org/wiki/File:Multiple...

    Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Donate

  6. List of algorithms - Wikipedia

    en.wikipedia.org/wiki/List_of_algorithms

    An algorithm is fundamentally a set of rules or defined procedures that is typically designed and used to solve a specific problem or a broad set of problems.. Broadly, algorithms define process(es), sets of rules, or methodologies that are to be followed in calculations, data processing, data mining, pattern recognition, automated reasoning or other problem-solving operations.

  7. Radix sort - Wikipedia

    en.wikipedia.org/wiki/Radix_sort

    In computer science, radix sort is a non-comparative sorting algorithm.It avoids comparison by creating and distributing elements into buckets according to their radix.For elements with more than one significant digit, this bucketing process is repeated for each digit, while preserving the ordering of the prior step, until all digits have been considered.

  8. Patience sorting - Wikipedia

    en.wikipedia.org/wiki/Patience_sorting

    Each subsequent card is placed on the leftmost existing pile whose top card has a value greater than or equal to the new card's value, or to the right of all of the existing piles, thus forming a new pile. When there are no more cards remaining to deal, the game ends. This card game is turned into a two-phase sorting algorithm, as follows.

  9. Wisconsin Card Sorting Test - Wikipedia

    en.wikipedia.org/wiki/Wisconsin_Card_Sorting_Test

    The Wisconsin Card Sorting Test (WCST) is a neuropsychological test of set-shifting, which is the capability to show flexibility when exposed to changes in reinforcement. [ 1 ] [ 2 ] The WCST was written by David A. Grant and Esta A. Berg.