10909 search results - page 538 / 2182 » Evaluating Backup Algorithms |
178
click to vote
WSC
2007
15 years 9 months ago
2007
We study the one-dimensional root finding problem for increasing convex functions. We give gradient-free algorithms for both exact and inexact (stochastic) function evaluations. ...
152
click to vote
ACL
2008
15 years 8 months ago
2008
A solution to the problem of homograph (words with multiple distinct meanings) identification is proposed and evaluated in this paper. It is demonstrated that a mixture model base...
173
click to vote
AAAI
2004
15 years 8 months ago
2004
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
161
click to vote
ACL
2006
15 years 8 months ago
2006
One of the challenges in the automatic generation of referring expressions is to identify a set of domain entities coherently, that is, from the same conceptual perspective. We de...
142
click to vote
ACL
2006
15 years 8 months ago
2006
We describe a generic framework for integrating various stochastic models of discourse coherence in a manner that takes advantage of their individual strengths. An integral part o...