Trivially perfect graphIn graph theory, a trivially perfect graph is a graph with the property that in each of its induced subgraphs the size of the maximum independent set equals the number of maximal cliques. Trivially perfect graphs were first studied by but were named by ; Golumbic writes that "the name was chosen since it is trivial to show that such a graph is perfect." Trivially perfect graphs are also known as comparability graphs of trees, arborescent comparability graphs, and quasi-threshold graphs.
Swarm roboticsSwarm robotics is an approach to the coordination of multiple robots as a system which consist of large numbers of mostly simple physical robots. ′′In a robot swarm, the collective behavior of the robots results from local interactions between the robots and between the robots and the environment in which they act.′′ It is supposed that a desired collective behavior emerges from the interactions between the robots and interactions of robots with the environment.
Battery chargerA battery charger, recharger, or simply charger, is a device that stores energy in a battery by running an electric current through it. The charging protocol (how much voltage or current for how long, and what to do when charging is complete) depends on the size and type of the battery being charged. Some battery types have high tolerance for overcharging (i.e., continued charging after the battery has been fully charged) and can be recharged by connection to a constant voltage source or a constant current source, depending on battery type.
Chordal graphIn the mathematical area of graph theory, a chordal graph is one in which all cycles of four or more vertices have a chord, which is an edge that is not part of the cycle but connects two vertices of the cycle. Equivalently, every induced cycle in the graph should have exactly three vertices. The chordal graphs may also be characterized as the graphs that have perfect elimination orderings, as the graphs in which each minimal separator is a clique, and as the intersection graphs of subtrees of a tree.
Lead–acid batteryThe lead–acid battery is a type of rechargeable battery first invented in 1859 by French physicist Gaston Planté. It is the first type of rechargeable battery ever created. Compared to modern rechargeable batteries, lead–acid batteries have relatively low energy density. Despite this, their ability to supply high surge currents means that the cells have a relatively large power-to-weight ratio. These features, along with their low cost, make them attractive for use in motor vehicles to provide the high current required by starter motors.
Nickel–cadmium batteryThe nickel-cadmium battery (Ni-Cd battery or NiCad battery) is a type of rechargeable battery using nickel oxide hydroxide and metallic cadmium as electrodes. The abbreviation Ni-Cd is derived from the chemical symbols of nickel (Ni) and cadmium (Cd): the abbreviation NiCad is a registered trademark of SAFT Corporation, although this brand name is commonly used to describe all Ni-Cd batteries. Wet-cell nickel-cadmium batteries were invented in 1899. A Ni-Cd battery has a terminal voltage during discharge of around 1.
Computer networkA computer network is a set of computers sharing resources located on or provided by network nodes. Computers use common communication protocols over digital interconnections to communicate with each other. These interconnections are made up of telecommunication network technologies based on physically wired, optical, and wireless radio-frequency methods that may be arranged in a variety of network topologies. The nodes of a computer network can include personal computers, servers, networking hardware, or other specialized or general-purpose hosts.
Distributed algorithmA distributed algorithm is an algorithm designed to run on computer hardware constructed from interconnected processors. Distributed algorithms are used in different application areas of distributed computing, such as telecommunications, scientific computing, distributed information processing, and real-time process control. Standard problems solved by distributed algorithms include leader election, consensus, distributed search, spanning tree generation, mutual exclusion, and resource allocation.
Intelligent agentIn artificial intelligence, an intelligent agent (IA) is an agent acting in an intelligent manner; It perceives its environment, takes actions autonomously in order to achieve goals, and may improve its performance with learning or acquiring knowledge. An intelligent agent may be simple or complex: A thermostat or other control system is considered an example of an intelligent agent, as is a human being, as is any system that meets the definition, such as a firm, a state, or a biome.
Caterpillar treeIn graph theory, a caterpillar or caterpillar tree is a tree in which all the vertices are within distance 1 of a central path. Caterpillars were first studied in a series of papers by Harary and Schwenk. The name was suggested by Arthur Hobbs. As colorfully write, "A caterpillar is a tree which metamorphoses into a path when its cocoon of endpoints is removed." The following characterizations all describe the caterpillar trees: They are the trees for which removing the leaves and incident edges produces a path graph.
