117 search results - page 4 / 24 » Characterization of polyhedron monotonicity |
JSYML
2010
13 years 9 months ago
2010
We extend the notion of limitwise monotonic functions to include arbitrary computable domains. We then study which sets and degrees are support increasing (support strictly increas...
EOR
2008
13 years 11 months ago
2008
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
CAEPIA
2009
Springer
13 years 12 months ago
2009
Springer
We slightly improve on characterization results already in the literature for base revision. We show that in order to axiomatically characterize revision operators in a logic the o...
DBPL
2001
Springer
14 years 3 months ago
2001
Springer
Abstract. We present a simple Data Mining Logic (DML) that can express common data mining tasks, like “Find Boolean association rules” or “Find inclusion dependencies.” At ...
IMR
2003
Springer
14 years 4 months ago
2003
Springer
The 8-tetrahedra longest-edge (8T-LE) partition of any tetrahedron is defined in terms of three consecutive edge bisections, the first one performed by the longest-edge. The ass...