14548 search results - page 368 / 2910 » The Optimal Path-Matching Problem |
142
click to vote
WG
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
155
click to vote
GECCO
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. This paper introduces the notion of Run Transferable Libraries, a mechanism to pass knowledge acquired in one GP run to another. We demonstrate that a system using these ...
196
click to vote
COLT
2003
Springer
15 years 12 months ago
2003
Springer
We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...
133
click to vote
ISAAC
2003
Springer
15 years 12 months ago
2003
Springer
Given k sorted arrays, the t-Threshold problem, which is motivated by indexed search engines, consists of finding the elements which are present in at least t of the arrays. We pr...
165
Voted
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...