Sciweavers

1220 search results - page 109 / 244
» Minimal Interval Completions
Sort
View
IJCAI
2003
13 years 10 months ago
Non-Standard Reasoning Services for the Debugging of Description Logic Terminologies
Current Description Logic reasoning systems provide only limited support for debugging logically erroneous knowledge bases. In this paper we propose new non-standard reasoning ser...
Stefan Schlobach, Ronald Cornet
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
13 years 9 months ago
A Note on the Number of Hamiltonian Paths in Strong Tournaments
We prove that the minimum number of distinct hamiltonian paths in a strong tournament of order n is 5 n-1 3 . A known construction shows this number is best possible when n 1 mod...
Arthur H. Busch
JAT
2006
84views more  JAT 2006»
13 years 9 months ago
Bivariate Lagrange interpolation at the Padua points: The generating curve approach
We give a simple, geometric and explicit construction of bivariate interpolation at certain points in a square (called Padua points), giving compact formulas for their fundamental...
Len Bos, Marco Caliari, Stefano De Marchi, Marco V...
IPL
2002
86views more  IPL 2002»
13 years 8 months ago
A polynomial algorithm for lot-size scheduling of two type tasks
We study the problem of scheduling unit time tasks of two types on m parallel identical machines. For each type, given numbers of tasks are required to be completed by the specifi...
Mikhail Y. Kovalyov, Marcus Pattloch, Günter ...
COCOON
2009
Springer
13 years 7 months ago
An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
Given a sequencing of jobs on a single machine, each one with a weight, processing time, and a due date, the tardiness of a job is the time needed for its completion beyond its du...
George Karakostas, Stavros G. Kolliopoulos, Jing W...