895 search results - page 110 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
ESA
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
106
click to vote
WEBI
2005
Springer
15 years 4 months ago
2005
Springer
Schema matching is a complex process focusing on matching between concepts describing the data in heterogeneous data sources. There is a shift from manual schema matching, done by...
SIGECOM
2009
ACM
15 years 5 months ago
2009
ACM
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
CPHYSICS
2006
14 years 11 months ago
2006
A modification of the standard Simulated Annealing (SA) algorithm is presented for finding the global minimum of a continuous multidimensional, multimodal function. We report resu...
SODA
2010
ACM
15 years 8 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...