840 search results - page 109 / 168 » Inapproximability of Combinatorial Optimization Problems |
102
click to vote
ESA
2007
Springer
15 years 6 months ago
2007
Springer
We review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research. In this talk I...
107
Voted
APPROX
2005
Springer
15 years 6 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
114
click to vote
CODES
2003
IEEE
15 years 5 months ago
2003
IEEE
In the Sesame framework, we develop a modeling and simulation environment for the efficient design space exploration of heterogeneous embedded systems. Since Sesame recognizes se...
102
Voted
CORR
2010
Springer
15 years 14 days ago
2010
Springer
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequencydivision multi...
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...