Showing 63,041 - 63,050 of 63,677
networks microscopic details. The commonly used algorithm for counting small-scale motifs is the one developed by Milo et al …. This algorithm is extremely costly in CPU time and actually cannot work on large networks, consisting of more than 100 …
Persistent link: https://www.econbiz.de/10010871718
, interacting via the Lennard–Jones potential. We propose a reliable and efficient numerical algorithm to obtain void statistics …
Persistent link: https://www.econbiz.de/10010874522
We present a geometric model of social choice among bundles of interdependent elements, that we will call objects. We show that the outcome of the social choice process is highly dependent on the way these bundles are formed. By bundling and unbundling the same set of constituent elements an...
Persistent link: https://www.econbiz.de/10010883455
Persistent link: https://www.econbiz.de/10010847745
In the article investigational method of diagnostics of efficiency of controlling of business processes, resulting in its implementation it is possible to identify deficiencies controlling systems. The essence of this method is compared to the controlling systems with a reference value.
Persistent link: https://www.econbiz.de/10010855210
Web servers worldwide generate a vast amount of information on web users’ browsing activities. Several researchers have studied these so-called clickstream or web access log data to better understand and characterize web users. The goal of this application is to analyze user behaviour by...
Persistent link: https://www.econbiz.de/10010858398
In this paper, the authors develop a new estimation method that is suitable for censored models with two high-dimensional fixed effects and that is based on a sequence of least squares regressions, yielding significant savings in computing time and hence making it applicable to frameworks in...
Persistent link: https://www.econbiz.de/10010983179
We propose and axiomatically analyze a class of rational solutions to simple allocation problems where a policy-maker allocates an endowment <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$E$$</EquationSource> </InlineEquation> among <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$$n$$</EquationSource> </InlineEquation> agents described by a characteristic vector c. We propose a class of recursive rules which mimic a decision process where the...</equationsource></inlineequation></equationsource></inlineequation>
Persistent link: https://www.econbiz.de/10010988767
: hardware area A and execution time E. An efficient heuristic algorithm with running time O(nlog⁡n) is proposed for the quality … approximate solutions of the problems with n code fragments. Also, an exact algorithm based on dynamic programming is presented to …
Persistent link: https://www.econbiz.de/10011050431
. Specifically, we investigate the appearance of maximum values of minors. The presented algorithm is tested for several values of j … and for Hadamard matrices of order 20. This algorithm is useful in the study of the growth factor for Hadamard matrices …
Persistent link: https://www.econbiz.de/10011050643