For any Boolean functionf letL(f) be its formulasizecomplexityin the basis f^ 1g. For every n and every k n=2, we describe a probabilistic distribution on formulas in the basis f^...
The question of nonemptiness of the intersection of a nested sequence of closed sets is fundamental in a number of important optimization topics, including the existence of optima...
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...
—Due to a continued increase in the speed and capacities of computing devices, combined with our society’s growing need for mobile communication capabilities, multihop wireless...
In this paper we analyze the performance of execution of service workflows in virtual machines (VMs) used as resources in our service-oriented grid testbed (SGT). We chosen an app...
Carlos R. Senna, Luiz F. Bittencourt, Edmundo R. M...