Sciweavers

620 search results - page 69 / 124
» Likelihood Computations Using Value Abstraction
Sort
View
PLILP
1994
Springer
14 years 2 months ago
Dynamic Dependence in Term rewriting Systems and its Application to Program Slicing
Abstract. Program slicing is a useful technique for debugging, testing, and analyzing programs. A program slice consists of the parts of a program which (potentially) affect the va...
John Field, Frank Tip
JFPLC
2004
13 years 11 months ago
Explications pour comprendre la trace d'un solveur de contraintes sur domaines finis
ABSTRACT. Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU...
Gérard Ferrand, Willy Lesaint, Alexandre Te...
BMVC
1998
13 years 11 months ago
Planar Curve Representation and Matching
In this paper, we discuss a method for representing and matching planar curves. The technique is based on using calculations from concentric circles to represent each curve by two...
Maher Al-Khaiyat, Farhad Kamangar
BIRTHDAY
2005
Springer
14 years 3 months ago
Psychological Validity of Schematic Proofs
Schematic proofs are functions which can produce a proof of a proposition for each value of their parameters. A schematic proof can be constructed by abstracting a general pattern ...
Mateja Jamnik, Alan Bundy
DIS
2008
Springer
13 years 11 months ago
Active Learning for High Throughput Screening
Abstract. An important task in many scientific and engineering disciplines is to set up experiments with the goal of finding the best instances (substances, compositions, designs) ...
Kurt De Grave, Jan Ramon, Luc De Raedt