Sciweavers

34 search results - page 4 / 7
» Comparing Unification Algorithms in First-Order Theorem Prov...
Sort
View
LICS
1999
IEEE
13 years 12 months ago
Subtyping Recursive Types in Kernel Fun
The problem of defining and checking a subtype relation between recursive types was studied in [3] for a first order type system, but for second order systems, which combine subty...
Dario Colazzo, Giorgio Ghelli
ECML
2007
Springer
14 years 1 months ago
Generalization-Based Similarity for Conceptual Clustering
The availability of techniques for comparing descriptions has many applications in Artificial Intelligence, ranging from description selection to flexible matching, from instance...
Stefano Ferilli, Teresa Maria Altomare Basile, Nic...
AMC
2005
138views more  AMC 2005»
13 years 7 months ago
Optimal centers in branch-and-prune algorithms for univariate global optimization
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...
D. G. Sotiropoulos, T. N. Grapsa
VSTTE
2012
Springer
12 years 3 months ago
Infeasible Code Detection
A piece of code in a computer program is infeasible if it cannot be part of any normally-terminating execution of the program. We develop an algorithm for the automatic detection o...
Cristiano Bertolini, Martin Schäf, Pascal Sch...
SIGMETRICS
2002
ACM
106views Hardware» more  SIGMETRICS 2002»
13 years 7 months ago
Analysis of methods for scheduling low priority disk drive tasks
This paper analyzes various algorithms for scheduling low priority disk drive tasks. The derived closed form solution is applicable to class of greedy algorithms that include a va...
Eitan Bachmat, Jiri Schindler