2654 search results - page 336 / 531 » On Pairing Inversion Problems |
136
Voted
IJCAI
1997
15 years 6 months ago
1997
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
132
click to vote
NIPS
1994
15 years 6 months ago
1994
In this paper, we present an improved version of the online phase-space learning algorithm of Tsung and Cottrell (1995), called ARTISTE (Autonomous Real-TIme Selection of Training...
125
click to vote
COLING
1992
15 years 6 months ago
1992
Parsing a long sentence is very difficult, since long sentences often have conjunctions which result in ambiguities. If the conjunctive structures existing in a long sentence can ...
183
click to vote
ASIAN
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static ...
141
Voted
AI
2010
Springer
15 years 5 months ago
2010
Springer
We investigate the problem of eliciting CP-nets in the well-known model of exact learning with equivalence and membership queries. The goal is to identify a preference ordering wi...