3367 search results - page 202 / 674 » Incremental assignment problem |
156
click to vote
KDD
2007
ACM
16 years 3 months ago
2007
ACM
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...
132
click to vote
JAIR
2008
15 years 3 months ago
2008
In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agent...
173
click to vote
PAMI
2008
15 years 3 months ago
2008
A common way to model multiclass classification problems is by means of Error-Correcting Output Codes (ECOCs). Given a multiclass problem, the ECOC technique designs a code word fo...
126
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...
147
Voted
CEC
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...