๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient constraint handling method for genetic algorithms

โœ Scribed by Kalyanmoy Deb

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
463 KB
Volume
186
Category
Article
ISSN
0045-7825

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A solving method of an mdp with a constr
A solving method of an mdp with a constraint by genetic algorithms
โœ K Hirayama; H Kawai ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 550 KB

consider a discrete time Markov decision process (MDP) with a finite state space, a finite action space, and two kinds of immediate rewards. The problem is to maximize the time average reward generated by one reward stream, subject to the other reward not being smaller than a prescribed value. An MD

An Algorithm for Handling Many Relationa
An Algorithm for Handling Many Relational Calculus Queries Efficiently
โœ Dan E. Willard ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 390 KB

This article classifies a group of complicated relational calculus queries whose search algorithms run in time OรฐI Log d I รพ Uรž and space OรฐIรž, where I and U are the sizes of the input and output, and d is a constant depending on the query (which is usually, but not always, equal to zero or one). Ou

An Efficient Exact Algorithm for Constra
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover
โœ Henning Fernau; Rolf Niedermeier ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 382 KB

The constraint bipartite vertex cover problem (CBVC for short) is as follows: given a bipartite graph G with n vertices and two positive integers k 1 k 2 , is there a vertex cover taking at most k 1 vertices from one and at most k 2 vertices from the other vertex set of G? CBVC is NP-complete. It fo