Sciweavers

131 search results - page 15 / 27
» Interval Arithmetic with Containment Sets
Sort
View
ENDM
2010
127views more  ENDM 2010»
13 years 7 months ago
MPQ-trees for orthogonal packing problem
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...
Cédric Joncour, Arnaud Pêcher, Petru ...
DAM
2006
88views more  DAM 2006»
13 years 7 months ago
A characterization of triangle-free tolerance graphs
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...
Arthur H. Busch
MP
2006
81views more  MP 2006»
13 years 7 months ago
Almost all webs are not rank-perfect
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]...
Arnaud Pêcher, Annegret Wagler
EUSFLAT
2007
193views Fuzzy Logic» more  EUSFLAT 2007»
13 years 9 months ago
A Universal Integral
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...
Erich-Peter Klement, Radko Mesiar, Endre Pap
LMCS
2006
79views more  LMCS 2006»
13 years 7 months ago
Computably Based Locally Compact Spaces
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...
Paul Taylor 0002