1871 search results - page 45 / 375 » The Ephemeral Pairing Problem |
ICMLA
2004
15 years 15 days ago
2004
In some environments, a learning agent must learn to balance competing objectives. For example, a Q-learner agent may need to learn which choices expose the agent to risk and whic...
79
Voted
ICIP
2001
IEEE
16 years 21 days ago
2001
IEEE
An elementary proof of a basic uncertainty principle concerning pairs of representations of ?? vectors in different orthonormal bases is provided. The result, slightly stronger th...
FSKD
2006
Springer
15 years 2 months ago
2006
Springer
We regard answer extraction of Question Answering (QA) system as a classification problem, classifying answer candidate sentences into positive or negative. To confirm the feasibil...
108
click to vote
IWOCA
2010
Springer
14 years 6 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...