16430 search results - page 794 / 3286 » On Computable Tree Functions |
208
click to vote
IPMU
1992
Springer
15 years 11 months ago
1992
Springer
This paper deals with the problem of inference under uncertain information. This is a generalization of a paper of Cardona et al. (1991a) where rules were not allowed to contain n...
201
click to vote
CP
2008
Springer
15 years 9 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
193
click to vote
MASCOTS
2004
15 years 9 months ago
2004
One of the primary challenges facing scalable network emulation and simulation is the overhead of storing network-wide routing tables or computing appropriate routes on a per-pack...
188
click to vote
UAI
2004
15 years 9 months ago
2004
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...
224
click to vote
ANLP
2000
15 years 9 months ago
2000
We empirically show that there are significant differences between the discourse structure of Japanese texts and the discourse structure of their corresponding English translation...