994 search results - page 37 / 199 » Custom Computing Machines for the Set Covering Problem |
113
click to vote
COLT
1993
Springer
15 years 4 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
94
Voted
AAAI
1998
15 years 2 months ago
1998
We have built a set of integrated AI systems (called conversation machines) to enable transaction processing over the telephone for limited domains like stock trading and banking....
92
Voted
SAC
1997
ACM
15 years 5 months ago
1997
ACM
At the 1996 Symposium on Applied Computing, it was argued that the R-by-C Crozzle problem was NP-Hard, but not in NP. The original Crozzle problem is a word puzzle that appears, w...
120
Voted
COLING
2010
14 years 7 months ago
2010
This paper addresses the problem of dynamic model parameter selection for loglinear model based statistical machine translation (SMT) systems. In this work, we propose a principle...
114
Voted
IFIPTCS
2000
15 years 4 months ago
2000
Hierarchical state machines are finite state machines whose states themselves can be other machines. In spite of their popularity in many modeling tools for software design, very l...