Sciweavers

3591 search results - page 292 / 719
» Typing linear constraints
Sort
View
CORR
2006
Springer
128views Education» more  CORR 2006»
15 years 7 months ago
Generalizations of the Hanoi Towers Problem
Our theme bases on the classical Hanoi Towers Problem. In this paper we will define a new problem, permitting some positions, that were not legal in the classical problem. Our goa...
Sergey Benditkis, Ilya Safro
CORR
2007
Springer
97views Education» more  CORR 2007»
15 years 7 months ago
Unfolding Restricted Convex Caps
This paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restri...
Joseph O'Rourke
JUCS
2007
102views more  JUCS 2007»
15 years 7 months ago
Pedagogical Natural Deduction Systems: the Propositional Case
: This paper introduces the notion of pedagogical natural deduction systems, which are natural deduction systems with the following additional constraint: all hypotheses made in a ...
Loïc Colson, David Michel
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 7 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
MP
2007
76views more  MP 2007»
15 years 6 months ago
Universal duality in conic convex optimization
Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both...
Simon P. Schurr, André L. Tits, Dianne P. O...