536 search results - page 68 / 108 » AI techniques in modelling, assignment, problem solving and ... |
140
click to vote
NIPS
2001
15 years 5 months ago
2001
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/ener...
124
click to vote
CVPR
2010
IEEE
16 years 16 days ago
2010
IEEE
Purely bottom-up, unsupervised segmentation of a single
image into two segments remains a challenging task for
computer vision. The co-segmentation problem is the process
of joi...
121
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
This paper deals with the adaptive variance scaling issue in continuous Estimation of Distribution Algorithms. A phenomenon is discovered that current adaptive variance scaling me...
108
click to vote
SRDS
2006
IEEE
15 years 10 months ago
2006
IEEE
In order to safeguard a sensitive database, we must ensure both its privacy and its longevity. However, privacy and longevity tend to be competing objectives. We show how to desig...
146
Voted
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...