Sciweavers

6300 search results - page 341 / 1260
» We have it easy, but do we have it right
Sort
View
FLAIRS
2000
15 years 3 months ago
Zooming in on Trade-Offs in Qualitative Probabilistic Networks
Qualitative probabilistic networks have been designed for probabilistic reasoning in a qualitative way. As a consequence of their coarse level of representation detail, qualitativ...
Silja Renooij, Linda C. van der Gaag, Shaw Green, ...
JFPLC
2000
15 years 3 months ago
Preuves infinies en Programmation logique
ABSTRACT. This paper focuses on the assignment of meaning to some nonterminating SLD derivations in logic programming. Several approaches have been developped by considering infini...
Mathieu Jaume
UAI
2000
15 years 3 months ago
Pivotal Pruning of Trade-offs in QPNs
Qualitative probabilistic networks have been designed for probabilistic reasoning in a qualitative way. Due to their coarse level of representation detail, qualitative probabilist...
Silja Renooij, Linda C. van der Gaag, Simon Parson...
CAGD
2010
118views more  CAGD 2010»
15 years 2 months ago
Topology of 2D and 3D rational curves
In this paper we present algorithms for computing the topology of planar and space rational curves defined by a parametrization. The algorithms given here work directly with the p...
Juan Gerardo Alcázar, Gema María D&i...
CROSSROADS
2006
139views more  CROSSROADS 2006»
15 years 2 months ago
C-Transformers: a framework to write C program transformations
Program transformation techniques have reached a maturity level that allows processing high-level language sources in new ways. Not only do they revolutionize the implementation o...
Alexandre Borghi, Valentin David, Akim Demaille