454 search results - page 54 / 91 » On improving approximate solutions by evolutionary algorithm... |
129
click to vote
APPROX
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
109
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
Recent research into single–objective continuous Estimation– of–Distribution Algorithms (EDAs) has shown that when maximum–likelihood estimations are used for parametric d...
121
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
116
click to vote
ICML
2002
IEEE
16 years 2 months ago
2002
IEEE
One of the central challenges in reinforcement learning is to balance the exploration/exploitation tradeoff while scaling up to large problems. Although model-based reinforcement ...
121
click to vote
CPM
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...