By this instruction we may be capaciated to observe those errors. --Dryden. [1913 Webster]
The Collaborative International Dictionary of English. 2000.
capacitated — ca pac·i·tate || teɪt v. give capacity; accommodate … English contemporary dictionary
be capacitated — Physiology (of spermatozoa) undergo changes inside the female reproductive tract enabling them to penetrate and fertilize an ovum. → capacitate … English new terms dictionary
Ant colony optimization algorithms — Ant behavior was the inspiration for the metaheuristic optimization technique. In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be… … Wikipedia
Problema de rutas de vehículos — «VRP» redirige aquí. Para otras acepciones, véase VRP (desambiguación). Esquema básico de un VRP. Los problemas de rutas de vehículos (Vehicle Routing Problem VRP) en realidad son un amplio conjunto de variantes y personalizaciones de problemas.… … Wikipedia Español
Fertilisation — This article is about fertilisation in animals and plants. For fertilisation in humans specifically, see Human fertilization. For Soil improvement, see Fertiliser. Conceive redirects here. For the health magazine, see Conceive magazine. For… … Wikipedia
Montgomery County Public Schools — Location Rockville, Maryland 20850 Information School type Public … Wikipedia
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia
AKAP3 — A kinase (PRKA) anchor protein 3, also known as AKAP3, is a human gene.cite web | title = Entrez Gene: AKAP3 A kinase (PRKA) anchor protein 3| url = http://www.ncbi.nlm.nih.gov/sites/entrez?Db=gene Cmd=ShowDetailView TermToSearch=10566|… … Wikipedia
Liste De Problèmes NP-Complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive … Wikipédia en Français
Liste de problemes NP-complets — Liste de problèmes NP complets Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets,… … Wikipédia en Français
