TERMIUM Plus^®

Fiche 1,  Justifications,  Anglais

Record number: 1, Textual support number: 1 DEF

... a node in a graph that meets defined criteria for success or termination.  2, fiche 1, Anglais, - goal%20node

Fiche 1,  Justifications,  Français

Fiche 1,  Justifications,  Espagnol

Fiche 2,  Justifications,  Anglais

Record number: 2, Textual support number: 1 CONT

A scene graph is an ordered collection of nodes... Each node holds some piece of information about the scene, such as material, shape description, transformation, or light.  2, fiche 2, Anglais, - scene%20graph

Fiche 2,  Justifications,  Français

Record number: 2, Textual support number: 1 CONT

Un graphe de scène est une structure de données qui permet de stocker de manière logique la représentation d'une scène virtuelle [...]  2, fiche 2, Français, - graphe%20de%20sc%C3%A8ne

Fiche 2,  Justifications,  Espagnol

Fiche 3,  Justifications,  Anglais

Record number: 3, Textual support number: 1 CONT

A Hamiltonian graph is a graph with a circuit – a path starting and ending at the same point – [that] visits each node exactly once.  2, fiche 3, Anglais, - Hamiltonian%20graph

Fiche 3,  Justifications,  Français

Record number: 3, Textual support number: 1 CONT

Graphe hamiltonien. Un graphe est hamiltonien si l'on peut trouver un cycle passant une fois et une seule fois par tous les sommets.  2, fiche 3, Français, - graphe%20hamiltonien

Fiche 3,  Justifications,  Espagnol

Record number: 3, Textual support number: 1 CONT

Gráfico no dirigido con un ciclo simple a través de cada vértice.  1, fiche 3, Espagnol, - gr%C3%A1fico%20hamiltoniano

Fiche 4,  Justifications,  Anglais

Record number: 4, Textual support number: 1 DEF

A graph traversal algorithm that explores nodes in the order of their distance from the roots, where distance is defined as the minimum path length from a root to the node.  3, fiche 4, Anglais, - breadth%2Dfirst%20search%20algorithm

Record number: 4, Textual support number: 1 OBS

It starts at the tree root(or some arbitrary node of a graph, sometimes referred to as a 'search key’), and explores all of the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.  4, fiche 4, Anglais, - breadth%2Dfirst%20search%20algorithm

Fiche 4,  Justifications,  Français

Record number: 4, Textual support number: 1 CONT

L'algorithme de parcours en largeur permet de calculer les distances de tous les nœuds depuis un nœud source dans un graphe non pondéré (orienté ou non orienté). Il peut aussi servir à déterminer si un graphe non orienté est connexe.  3, fiche 4, Français, - algorithme%20de%20parcours%20en%20largeur%20d%27abord

Fiche 4,  Justifications,  Espagnol

Fiche 5,  Justifications,  Anglais

Record number: 5, Textual support number: 1 CONT

... a net structure formed by connecting, through a node, a parent arc representing a common portion of a plurality of standard patterns as recognition units of a recognition target to a child arc representing a remaining portion ...  3, fiche 5, Anglais, - parent%20arc

Record number: 5, Textual support number: 2 CONT

The graph will end up ill-formed if you delete a node which has parent arcs pointing to it.  4, fiche 5, Anglais, - parent%20arc

Record number: 5, Textual support number: 1 OBS

An activity has duration, and possesses one child and one parent arc.  5, fiche 5, Anglais, - parent%20arc

Record number: 5, Textual support number: 2 OBS

parent arc: term used at Natural Resources Canada - Earth Sciences Sector.  6, fiche 5, Anglais, - parent%20arc

Fiche 5,  Justifications,  Français

Record number: 5, Textual support number: 1 CONT

Une redondance de calcul dans un TED [Taylor Expansion Diagram] est repérée à chaque fois qu'il existe plus d'un arc parent arrivant à un nœud non trivial [...]  2, fiche 5, Français, - arc%20parental

Record number: 5, Textual support number: 1 OBS

arc parental : terme en usage à Ressources naturelles Canada - Secteur des sciences de la Terre.  3, fiche 5, Français, - arc%20parental

Fiche 5,  Justifications,  Espagnol

Fiche 6,  Justifications,  Français

Fiche 6,  Justifications,  Espagnol

Fiche 7,  Justifications,  Anglais

Record number: 7, Textual support number: 1 CONT

A state node contains a state name and may contain a save-signal-set. State nodes within a process graph have different names.  1, fiche 7, Anglais, - state%20node

Fiche 7,  Justifications,  Français

Fiche 7,  Justifications,  Espagnol

Fiche 8,  Justifications,  Anglais

Record number: 8, Textual support number: 1 DEF

A structure consisting of nodes and links (in which) a condition at any node can affect another node through a link. Conventionally its relationship to hyperspace and other inference functions is not described.  2, fiche 8, Anglais, - causal%20network

Record number: 8, Textual support number: 1 OBS

A directed graph where each node represents a variable.  3, fiche 8, Anglais, - causal%20network

Fiche 8,  Justifications,  Français

Record number: 8, Textual support number: 1 CONT

Un cas particulier des réseaux sémantiques sont des réseaux de causes ou les liens entre nœuds ne représentent que les relations de causes à effets.  1, fiche 8, Français, - r%C3%A9seau%20de%20causes

Fiche 8,  Justifications,  Espagnol

Fiche 9,  Justifications,  Anglais

Record number: 9, Textual support number: 1 CONT

The A[ star]: algorithm is a best-first search method. It means that the algorithm simultaneously contains several paths which may all be candidates for the shortest path. At any time, it selects the most promising node(best-first) at a time for expansion, and incorporates the successor nodes into the search graph. The criterion for evaluation is the length of the path from start to the node plus the estimate of the remaining distance(cost). The theory says that if the remaining estimate is an underestimate, the first solution will be optimal.  3, fiche 9, Anglais, - A%5Bstar%5D%20search%20algorithm

Record number: 9, Textual support number: 1 OBS

A[star] search algorithm; A[star] algorithm: The word "star" and the square brackets that surround it replace the symbol representing a star, also known as an "asterisk," because it cannot be reproduced due to technical constraints.  4, fiche 9, Anglais, - A%5Bstar%5D%20search%20algorithm

Fiche 9,  Justifications,  Français

Record number: 9, Textual support number: 1 CONT

L'algorithme A[étoile] est un algorithme de recherche [du] meilleur chemin de type meilleur d'abord. L'idée est de parcourir le graphe G depuis le sommet source jusqu'au sommet cible en se déplaçant dans les «meilleurs» sommets, [c'est-à-dire] ceux ayant le plus petit coût global : coût du chemin depuis la source + coût estimé jusqu'à la cible.  3, fiche 9, Français, - algorithme%20de%20recherche%20A%5B%C3%A9toile%5D

Record number: 9, Textual support number: 1 OBS

algorithme de recherche A[étoile]; algorithme A[étoile] : Le mot «étoile» et les crochets qui l'entourent remplacent le symbole représentant une étoile, aussi appelé «astérisque», parce qu'il est impossible de le reproduire en raison de contraintes techniques.  4, fiche 9, Français, - algorithme%20de%20recherche%20A%5B%C3%A9toile%5D

Fiche 9,  Justifications,  Espagnol

Fiche 10,  Justifications,  Anglais

Record number: 10, Textual support number: 1 DEF

A virtual terminal environment(VTE) that is a complete directed graph of VTE parameters in which all node parameters and terminal leaf parameters implied by all existing nodes from the root of the tree have values.  2, fiche 10, Anglais, - full%20virtual%20terminal%20environment

Fiche 10,  Justifications,  Français

Fiche 10,  Justifications,  Espagnol

Record number: 10, Textual support number: 1 DEF

Entorno que simula totalmente un terminal directamente conectado a un equipo.  2, fiche 10, Espagnol, - entorno%20de%20terminal%20virtual%20completo

Fiche 11,  Justifications,  Anglais

Record number: 11, Textual support number: 1 CONT

A Cayley tree is defined as a graph without loops in which each node has the same number of branches. The self-similarity of such graphs is not necessarily manifest in their geometric representation, but is seen in their connectivity or topology.  2, fiche 11, Anglais, - connectivity

Fiche 11,  Justifications,  Français

Record number: 11, Textual support number: 1 DEF

Propriété physique d'un objet qui permet d'aller d'un de ses points à un autre tout en restant dans la masse, dans la matière ou dans la structure de l'objet.  2, fiche 11, Français, - connectivit%C3%A9

Record number: 11, Textual support number: 1 OBS

Concept décrit en termes d'étalement, de tortuosité, d'élasticité et de squelette.  2, fiche 11, Français, - connectivit%C3%A9

Record number: 11, Textual support number: 1 PHR

degré de connectivité.  2, fiche 11, Français, - connectivit%C3%A9

Fiche 11,  Justifications,  Espagnol

Fiche 12,  Justifications,  Anglais

Record number: 12, Textual support number: 1 CONT

One solution is to generate the graph node by node. A complete reasoning path is generated until it either reaches the goal or hits a dead end. If it hits a dead end, the next path is generated, and so on.  2, fiche 12, Anglais, - reasoning%20path

Record number: 12, Textual support number: 2 CONT

It is necessary for the student to ask an exhaustive series of questions, if he is to discover all of the reasoning paths considered by the program.  3, fiche 12, Anglais, - reasoning%20path

Record number: 12, Textual support number: 3 CONT

When expert reasoning paths are not unique or a limited window into the student’s thinking prevents monitoring each step of a chain of reasoning, how is the tutor to apportion credit and blame for the student’s observable behavior among the different knowledge sources?  3, fiche 12, Anglais, - reasoning%20path

Fiche 12,  Justifications,  Français

Record number: 12, Textual support number: 1 DEF

L'enchaînement des connaissances qui a permis de conclure.  2, fiche 12, Français, - parcours%20de%20raisonnement

Record number: 12, Textual support number: 1 OBS

Distinct de la trace de raisonnement.  1, fiche 12, Français, - parcours%20de%20raisonnement

Fiche 12,  Justifications,  Espagnol

Fiche 13,  Justifications,  Anglais

Record number: 13, Textual support number: 1 DEF

A graph that demonstrates that the start node of a search space or search tree can be solved.  1, fiche 13, Anglais, - solution%20graph

Fiche 13,  Justifications,  Français

Fiche 13,  Justifications,  Espagnol

Fiche 14,  Justifications,  Anglais

Record number: 14, Textual support number: 1 CONT

A file in the UNIX system is described by an object called an i-node. We think that the name means "interior node", since the UNIX file-system is(in principle at least) a directed graph. For every file there is a single i-node that describes that file, and contains pointers to the blocks that comprise that file.  1, fiche 14, Anglais, - i%2Dnode

Fiche 14,  Justifications,  Français

Record number: 14, Textual support number: 1 DEF

Nom d'un fichier interne dans le système d'exploitation UNIX.  1, fiche 14, Français, - fichier%20inode

Fiche 14,  Justifications,  Espagnol

Fiche 15,  Justifications,  Anglais

Record number: 15, Textual support number: 1 DEF

A knowledge representation framework that places the emphasis on the crucial rides of the domain, adapting instruction to different viewpoint.  1, fiche 15, Anglais, - planning%20net

Record number: 15, Textual support number: 1 CONT

VanLehn and Brown(1980) propose the mechanism of planning nets for representing the meaning of procedures from a teleological perspective. A planning net is a directed graph. Nodes contain increasingly expanded flow charts that represent the partial design stages of a procedure being synthesized from first principles. Links stand both for domain-dependent constraints the procedure must comply with regarding the operation, the representation, or the physical substrate, and for general planning and derivational heuristics used to resolve violations of constraints. Two nodes are linked if applying a constraint or a heuristic to the procedure of the first one leads to the new version of the second one. The last node of the graph is the complete procedure.  1, fiche 15, Anglais, - planning%20net

Fiche 15,  Justifications,  Français

Record number: 15, Textual support number: 1 OBS

planificateur: programme générateur d'énoncés d'action à partir d'une base de tels énoncés et d'un but déterminé.  2, fiche 15, Français, - r%C3%A9seau%20de%20planification

Fiche 15,  Justifications,  Espagnol

Fiche 16,  Justifications,  Anglais

Record number: 16, Textual support number: 1 DEF

... a graph, each node of which represents an object, with each arc representing a relationship between two objects.  2, fiche 16, Anglais, - activation%20network

Fiche 16,  Justifications,  Français

Fiche 16,  Justifications,  Espagnol

Fiche 17,  Justifications,  Anglais

Record number: 17, Textual support number: 1 CONT

A graph structure whose terminal leaves are terms and where each node is an item that can sensibly be predicated of all the terms below in the graph.  2, fiche 17, Anglais, - graph%20structure

Fiche 17,  Justifications,  Français

Fiche 17,  Justifications,  Espagnol

Fiche 18,  Justifications,  Anglais

Record number: 18, Textual support number: 1 DEF

A state graph "expands" when it generates another node.  1, fiche 18, Anglais, - state%20graph%20expansion

Fiche 18,  Justifications,  Français

Record number: 18, Textual support number: 1 CONT

La "compilation des règles", c'est-à-dire la génération automatique d'un arbre de décision à partir de règles est une solution prometteuse mais limitée à certains problèmes.  1, fiche 18, Français, - g%C3%A9n%C3%A9ration%20automatique%20d%27arbre

Record number: 18, Textual support number: 1 OBS

Voir aussi "graphe d'états".  2, fiche 18, Français, - g%C3%A9n%C3%A9ration%20automatique%20d%27arbre

Fiche 18,  Justifications,  Espagnol