Sciweavers

10493 search results - page 315 / 2099
» Dynamic Word Problems
Sort
View
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
16 years 7 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
GECCO
2008
Springer
238views Optimization» more  GECCO 2008»
15 years 7 months ago
Using multiple offspring sampling to guide genetic algorithms to solve permutation problems
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
Antonio LaTorre, José Manuel Peña, V...
CDC
2008
IEEE
132views Control Systems» more  CDC 2008»
16 years 1 months ago
A distributed auction algorithm for the assignment problem
— The assignment problem constitutes one of the fundamental problems in the context of linear programming. Besides its theoretical significance, its frequent appearance in the a...
Michael M. Zavlanos, Leonid Spesivtsev, George J. ...
ASIAN
1999
Springer
186views Algorithms» more  ASIAN 1999»
15 years 11 months ago
Ant Colony Optimization for the Ship Berthing Problem
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
Chia Jim Tong, Hoong Chuin Lau, Andrew Lim
AAAI
2012
13 years 9 months ago
MOMDPs: A Solution for Modelling Adaptive Management Problems
In conservation biology and natural resource management, adaptive management is an iterative process of improving management by reducing uncertainty via monitoring. Adaptive manag...
Iadine Chades, Josie Carwardine, Tara G. Martin, S...