1647 search results - page 65 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
118
Voted
EVOW
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Addressing dynamic optimization problems has been a challenging task for the genetic algorithm community. Over the years, several approaches have been developed into gene...
120
click to vote
IJCGA
2002
15 years 4 months ago
2002
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...
151
click to vote
ICTAI
2009
IEEE
15 years 2 months ago
2009
IEEE
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
237
Voted
ICDE
2005
IEEE
16 years 6 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
140
Voted
COCO
2006
Springer
15 years 8 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...