Sciweavers

17760 search results - page 183 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
GECCO
1999
Springer
158views Optimization» more  GECCO 1999»
15 years 8 months ago
Coevolutionary Genetic Algorithms for Solving Dynamic Constraint Satisfaction Problems
In this paper, we discuss the adaptability of Coevolutionary Genetic Algorithms on dynamic environments. Our CGA consists of two populations: solution-level one and schema-level o...
Hisashi Handa, Osamu Katai, Tadataka Konishi, Mits...
ILP
2000
Springer
15 years 7 months ago
Searching the Subsumption Lattice by a Genetic Algorithm
A framework for combining Genetic Algorithms with ILP methods is introduced and a novel binary representation and relevant genetic operators are discussed. It is shown that the pro...
Alireza Tamaddoni-Nezhad, Stephen Muggleton
CIKM
2010
Springer
15 years 2 months ago
Evaluating, combining and generalizing recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the movie ‘Godfather...
Aditya G. Parameswaran, Hector Garcia-Molina, Jeff...
CORR
2002
Springer
102views Education» more  CORR 2002»
15 years 4 months ago
Tight Approximation Results for General Covering Integer Programs
In this paper we study approximation algorithms for solving a general covering integer program. An
Stavros G. Kolliopoulos, Neal E. Young
IPL
2006
139views more  IPL 2006»
15 years 4 months ago
An adjustable linear time parallel algorithm for maximum weight bipartite matching
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing
Morteza Fayyazi, David R. Kaeli, Waleed Meleis