Buffered Resource Constraint: Algorithms and Complexity

Our goal is, on one hand, to write down explicit first and second order optimality conditions for general 2-dimensional shape optimization problems with convexity con- straint and,

The resulting model has similarities to hidden Markov models, but supports recurrent networks processing style and allows to exploit the supervised learning paradigm while using

Let X be an algebraic curve defined over a finite field F q and let G be a smooth affine group scheme over X with connected fibers whose generic fiber is semisimple and

In the remainder of this paper, we will implicitly assume that all link diagrams are connected, and that a diagram is alternating within each twist region... Thurston [29,

If the given connected loopless bridgeless planar graph corresponds to the black regions of a knot (link) then to construct its companion graph, all one needs to

Based on these observations, we propose an adaptive version of POAC, called APOAC, where the number of times variables are processed for singleton tests on their values is

We then introduce an algorithm which, given a set of already sequenced activities, computes a buffer assignment which minimizes the number of switches in linear time, i.e., O(nd)

(French) [Some regular elements of Weyl groups and the associated Deligne-Lusztig varieties] Finite reductive groups (Luminy, 1994), 73–139, Progr.. Lusztig, Representations