840 search results - page 71 / 168 » Inapproximability of Combinatorial Optimization Problems |
113
click to vote
CORR
2004
Springer
15 years 2 months ago
2004
Springer
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...
124
click to vote
CIMCA
2005
IEEE
15 years 8 months ago
2005
IEEE
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...
111
click to vote
HM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The maximum diversity problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
118
click to vote
ICML
2009
IEEE
15 years 9 months ago
2009
IEEE
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
121
click to vote
FOCM
2007
15 years 3 months ago
2007
Abstract. We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in Rn and related problems of complex integration and opt...