1871 search results - page 169 / 375 » The Ephemeral Pairing Problem |
225
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
166
click to vote
ALENEX
2007
15 years 8 months ago
2007
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
173
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...
185
click to vote
IJCAI
2007
15 years 8 months ago
2007
A key problem in reinforcement learning is finding a good balance between the need to explore the environment and the need to gain rewards by exploiting existing knowledge. Much ...
168
click to vote
ALGORITHMICA
2007
15 years 6 months ago
2007
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...