1225 search results - page 16 / 245 » Maximal Consistent Subsets |
GECCO
2003
Springer
14 years 25 days ago
2003
Springer
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
ATMOS
2010
13 years 5 months ago
2010
In the traveling repairman problem with profits, a repairman (also known as the server) visits a subset of nodes in order to collect time-dependent profits. The objective consists...
ICCV
2009
IEEE
15 years 18 days ago
2009
IEEE
We propose a novel consistent max-covering scheme for
human pose estimation. Consistent max-covering formulates
pose estimation as the covering of body part polygons
on an objec...
ICDCSW
2003
IEEE
14 years 28 days ago
2003
IEEE
In this paper, we propose a novel cache consistency maintenance scheme, called Ë Ð Ð ×ÝÒ ÖÓÒÓÙ× ÓÒ× ×Ø Ò Ý Ë Ñ (SACCS), for mobile environments. It relies on ...
KDD
2010
ACM
13 years 9 months ago
2010
ACM
Influence maximization, defined by Kempe, Kleinberg, and Tardos (2003), is the problem of finding a small set of seed nodes in a social network that maximizes the spread of influe...