Paradiseo

Regardez d'autres dictionnaires:

• Paradiseo — infobox software caption = latest release version = 1.0 latest release date = release date|2007|10|12 developer = [http://www.inria.fr/recherche/equipes/dolphin.en.html DOLPHIN project team] of INRIA operating system = Cross platform genre =… …   Wikipedia

• Simulated annealing — (SA) is a generic probabilistic meta algorithm for the global optimization problem, namely locating a good approximation to the global optimum of a given function in a large search space. It is often used when the search space is discrete (e.g.,… …   Wikipedia

• Local search (optimization) — In computer science, local search is a metaheuristic for solving computationally hard optimization problems. Local search can be used on problems that can be formulated as finding a solution maximizing a criterion among a number of candidate… …   Wikipedia

• Particle swarm optimization — (PSO) is a swarm intelligence based algorithm to find a solution to an optimization problem in a search space, or model and predict social behavior in the presence of objectives.OverviewParticle swarm optimization is a stochastic, population… …   Wikipedia

• Hill climbing — In computer science, hill climbing is a mathematical optimization technique which belongs to the family of local search. It is relatively simple to implement, making it a popular first choice. Although more advanced algorithms may give better… …   Wikipedia

• Tabu search — is a mathematical optimization method, belonging to the class of local search techniques. Tabu search enhances the performance of a local search method by using memory structures: once a potential solution has been determined, it is marked as… …   Wikipedia

• Multiobjective optimization — Multi objective optimization (or programming), [cite book|last = Steuer|first = R.E.|title = Multiple Criteria Optimization: Theory, Computations, and Application|publisher = John Wiley Sons, Inc|date = 1986|location = New York|isbn = 047188846X] …   Wikipedia

• List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… …   Wikipedia

• Cmake — Développeurs Andy Cedilnik, Bill Hoffman, Brad King, Ken Martin, Alexander Neundorf …   Wikipédia en Français

• Recherche locale — En informatique, la recherche locale est une métaheuristique utilisée pour résoudre des problèmes d optimisation difficiles. La recherche locale peut être utilisée sur des problèmes de recherche d une solution maximisant un critère parmi un… …   Wikipédia en Français