Local cost minimization in ant transport networks: from small-scale data to large-scale trade-offs
نویسندگان
چکیده
منابع مشابه
From large-scale to small-scale dynamos
Several recent advances in turbulent dynamo theory are reviewed. High resolution simulations of small-scale and large-scale dynamo action in periodic domains are compared with each other and contrasted with similar results at low magnetic Prandtl numbers. It is argued that all the different cases show similarities at intermediate length scales. On the other hand, in the presence of helicity of ...
متن کاملMaking Large-Scale Networks from fMRI Data
Pairwise correlations are currently a popular way to estimate a large-scale network (> 1000 nodes) from functional magnetic resonance imaging data. However, this approach generally results in a poor representation of the true underlying network. The reason is that pairwise correlations cannot distinguish between direct and indirect connectivity. As a result, pairwise correlation networks can le...
متن کاملFrom Small to Very Large Scale Optimization
Abs t rac t We introduce some methods for constrained nonlinear programming that are widely used in practice and that are known under the names SQP for sequential quadratic programming and SCP for sequential convex programming. In both cases, convex subproblems are formulated, in the first case a quadratic programming problem, in the second case a separable nonlinear program in inverse variable...
متن کاملA Balanced Approach to High-Level Verification: Performance Trade-Offs in Verifying Large-Scale Multiprocessors
A single node of a modern scalable multiprocessor consists of several ASICs comprising tens of millions of gates. This level of integration and complexity imposes an enormous onus on the verification process. A variety of tools, ranging from discrete-event logic simulation to formal model checking, can be used to attack this problem. Unfortunately, conventional simulation techniques, with their...
متن کاملData compression trade-offs in sensor networks
This paper first discusses the need for data compression within sensor networks and argues that data compression is a fundamental tool for achieving trade-offs in sensor networks among three important sensor network parameters: energy-efficiency, accuracy, and latency. Next, it discusses how to use Fisher information to design data compression algorithms that address the trade-offs inherent in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of The Royal Society Interface
سال: 2015
ISSN: 1742-5689,1742-5662
DOI: 10.1098/rsif.2015.0780