16430 search results - page 933 / 3286 » On Computable Tree Functions |
212
click to vote
PCI
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. In this paper, we propose a novel heuristic algorithm for constructing a minimum cost multicast tree. Our work is based on a directed asymmetric network and shows an impr...
198
click to vote
INLG
2004
Springer
16 years 1 months ago
2004
Springer
This paper describes an implemented model of context-based incremental tactical generation within the Dynamic Syntax framework [1] which directly reflects dialogue phenomena such ...
198
click to vote
TABLEAUX
1999
Springer
15 years 12 months ago
1999
Springer
We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed wi...
192
click to vote
CP
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
200
click to vote
KDD
1995
ACM
15 years 11 months ago
1995
ACM
One objective of knowledge acquisition using inductive modeling has been the development of correct and effectively computable descriptions that can also be assimilated and used b...