32 search results - page 2 / 7 » Interval completion with few edges |
CSL
2008
Springer
13 years 9 months ago
2008
Springer
Interval logics are an important area of computer science. Although attention has been mainly focused on unary operators, an early work by Venema (1991) introduced an expressively ...
BIRTHDAY
2009
Springer
14 years 2 months ago
2009
Springer
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...
GD
2005
Springer
14 years 1 months ago
2005
Springer
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one co...
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
VMCAI
2005
Springer
14 years 1 months ago
2005
Springer
Interval computations, stochastic arithmetic, automatic differentiation, etc.: much work is currently done to estimate and to improve the numerical accuracy of programs but few c...