"Published in January 2005, the best-selling book Mastering EJB is now in its third edition and has been updated for EJB2.1 and also features new chapters on security and Web ...
In this paper, we show that for every constant 0 < < 1/2 and for every constant d 2, the minimum size of a depth d Boolean circuit that -approximates Majority function on n ...
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
Abstract. In this paper we address a common question in wireless communication: How long does it take to satisfy an arbitrary set of wireless communication requests? This problem i...
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...