CORR
2008
Springer
13 years 8 months ago
2008
Springer
: In this paper we consider two problems regarding the scheduling of available personnel in order to perform a given quantity of work, which can be arbitrarily decomposed into a se...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In this article we review standard null-move pruning and introduce our extended version of it, which we call verified null-move pruning. In verified null-move pruning, whenever th...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We study a special class of diamond channels which was introduced by Schein in
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We define a class of Z-interference channels for which we obtain a new upper bound on the capacity region. The bound exploits a technique first introduced by Korner and Marton. A ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
The paper is organized as a self-contained literate Haskell program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmet...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
CORR
2008
Springer
13 years 8 months ago
2008
Springer
This paper presents the generalization of weighted distances to modules and their computation through the chamfer algorithm on general point lattices. The first part is dedicated ...