2657 search results - page 192 / 532 » On the complexity of hierarchical problem solving |
127
click to vote
EMNLP
2004
15 years 3 months ago
2004
This paper presents Japanese morphological analysis based on conditional random fields (CRFs). Previous work in CRFs assumed that observation sequence (word) boundaries were fixed...
117
Voted
ECAI
2000
Springer
15 years 6 months ago
2000
Springer
Many complex real-world decision problems, such as planning, contain an underlying constraint reasoning problem. The feasibility of a solution candidate then depends on the consis...
NIPS
2003
15 years 3 months ago
2003
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
204
Voted
AGP
2010
IEEE
15 years 6 months ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
107
click to vote
AAAI
1993
15 years 3 months ago
1993
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...