131 search results - page 15 / 27 » Interval Arithmetic with Containment Sets |
110
click to vote
ENDM
2010
14 years 11 months ago
2010
Finding a feasible solution for a bi-dimensional Orthogonal Packing Problem (OPP2) consists in deciding whether a set of rectangular boxes (items) can be packed in a "big&quo...
97
Voted
DAM
2006
14 years 11 months ago
2006
We prove that a triangle-free graph G is a tolerance graph if and only if there exists a set of consecutively ordered stars that partition the edges of G. Since tolerance graphs a...
112
click to vote
MP
2006
14 years 11 months ago
2006
Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]...
EUSFLAT
2007
15 years 1 months ago
2007
Based on a minimal set of axioms we introduce a general integral which can be defined on arbitrary measurable spaces. It acts on measures which are only (finite) monotone set fu...
LMCS
2006
14 years 11 months ago
2006
tract Stone Duality) is a re-axiomatisation of general topology in which the topology on a space is treated, not as an infinitary lattice, but as an exponential object of the same...