840 search results - page 142 / 168 » Inapproximability of Combinatorial Optimization Problems |
123
click to vote
SIGECOM
2003
ACM
15 years 8 months ago
2003
ACM
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
154
click to vote
CEC
2011
IEEE
14 years 3 months ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
119
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
140
click to vote
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...
129
click to vote
JCO
2011
14 years 10 months ago
2011
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...