Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
Because of the constant reduction of available public network addresses and the necessity to secure networks, devices like Network Address Translators and firewalls have become qui...
Luigi Ciminiera, Guido Marchetto, Fulvio Risso, Li...
We consider the El Farol bar problem, also known as the minority game W. B. Arthur, The American Economic Review, 842: 406 411 1994, D. Challet and Y.C. Zhang, Physica A, 256:514 ...
— We propose two contrasting approaches to the scalable distributed control of a swarm of self-assembling miniaturized robots, specifically the formation of chains of a desired ...
Enterprise-level applications are becoming complex with the need for event and stream processing, multiple query processing and data analysis over heterogeneous data sources such ...