Sciweavers

7773 search results - page 56 / 1555
» On generalized Frame-Stewart numbers
Sort
View
CORR
2004
Springer
106views Education» more  CORR 2004»
15 years 5 months ago
Why Delannoy numbers?
This article is not a research paper, but a little note on the history of combinatorics: we present here a tentative short biography of Henri Delannoy, and a survey of his most no...
Cyril Banderier, Sylviane R. Schwer
KR
2000
Springer
15 years 9 months ago
Expressive ABox Reasoning with Number Restrictions, Role Hierarchies, and Transitively Closed Roles
We present a new tableaux calculus deciding the ABox consistency problem for the expressive description logic ALCNHR+ . Prominent language features of ALCNHR+ are number restricti...
Volker Haarslev, Ralf Möller
ESA
2008
Springer
127views Algorithms» more  ESA 2008»
15 years 7 months ago
The Alcuin Number of a Graph
We consider a planning problem that generalizes Alcuin's river crossing problem (also known as: The wolf, goat, and cabbage puzzle) to scenarios with arbitrary conflict graph...
Péter Csorba, Cor A. J. Hurkens, Gerhard J....
CORR
2008
Springer
138views Education» more  CORR 2008»
15 years 6 months ago
Efficient Implementation of the Generalized Tunstall Code Generation Algorithm
A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, ...
Michael B. Baer
CORR
2010
Springer
45views Education» more  CORR 2010»
15 years 6 months ago
Solution to the Counterfeit Coin Problem and its Generalization
: This work deals with a classic problem: "Given a set of coins among which there is a counterfeit coin of a different weight, find this counterfeit coin using ordinary balanc...
Juan Dominguez-Montes