11740 search results - page 304 / 2348 » More Problems in Rewriting |
175
click to vote
EMNLP
2007
15 years 8 months ago
2007
We describe a discriminatively trained sequence alignment model based on the averaged perceptron. In common with other approaches to sequence modeling using perceptrons, and in co...
147
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...
140
click to vote
AAAI
1994
15 years 8 months ago
1994
The paper evaluates the eectiveness of learning for speeding up the solution of constraint satisfaction problems. It extends previous work (Dechter 1990) by introducing a new and ...
170
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
188
Voted
DAM
2008
15 years 6 months ago
2008
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...