9719 search results - page 255 / 1944 » Answer Set Optimization |
177
click to vote
CEC
2008
IEEE
16 years 1 months ago
2008
IEEE
— In this paper, we propose a novel approach to solve constrained optimization problems based on particle swarm optimization (PSO). First, an empirical comparison of the most pop...
208
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
285
click to vote
TITB
2002
15 years 6 months ago
2002
The class of geometric deformable models, also known as level sets, has brought tremendous impact to medical imagery due to its capability of topology preservation and fast shape r...
159
click to vote
MP
2006
15 years 6 months ago
2006
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
148
click to vote
STACS
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. We develop for set cover games several general cost-sharing methods that are approximately budget-balanced, core, and/or group-strategyproof. We first study the cost sha...