Search results

...the process of individual [[learning]] of a set of agents with their own [[memory]] and their [[social learning theory|social learning]] with the knowledge p ...ing in parallel, with a social sharing library. Each agent holds a private memory containing one knowledge point, and the social sharing library contains a s ...

...August 25-27, 2020, Proceedings |chapter=ARTful Skyline Computation for In-Memory Database Systems |series=Communications in Computer and Information Science ...irst3=Matteo|title=Proceedings of the Ninth International Workshop on Data Management on New Hardware |chapter=Efficient GPU-based skyline computation |date=2013 ...

...n Y.|title=Finding the ''k'' Shortest Loopless Paths in a Network|journal= Management Science|date=Jul 1971|volume=17|issue=11|pages=712–716|jstor=2629312|doi=10 ...and the potential shortest path list <math>B</math>, <math>N^2 + KN</math> memory addresses are required.<ref name=yenksp2 /> At worse case, the every node i ...

...tempt to produce the best quality clustering for a given set of resources (memory and [[time constraint]]s). In most cases, BIRCH only requires a single scan ...the case wherein a data-set was too large to fit in [[Primary storage|main memory]]. As a result, there was a lot of overhead maintaining high clustering qua ...

|journal=Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures |title=Lower Bounds for External Memory Dictionaries ...

* '''[[Block swap algorithms|Block swap]]''': exchange a range of values within an array with values in One variant of block sort allows it to use any amount of additional memory provided to it, by using this ''external buffer'' for merging an A subarray ...

* Virtual resources, such as CPU time or computer memory; == Trivial algorithms == ...

...on has shown to be beneficial in this field. In this article two efficient algorithms solving this problem are introduced. ...is required. However, it is required that every processor has enough local memory to store the entire adjacency matrix of the graph. ...

...tions and decrease computational complexity. Typically, these [[Algorithm|algorithms]] are operated by the GeneRec algorithm.<ref name=":6" /> == Algorithms == ...

...= A Selection Problem of Shared Fixed Costs and Network Flows | journal = Management Science | volume = 17 | issue = 3| pages = 200–207 | doi = 10.1287/mnsc.17. ...polynomial time]] based on [[dynamic programming]] and other [[heuristic]] algorithms that can always generate “good” solutions. ...

...4=Wong |first4=Limsoon |last5=Yu |first5=Cui |title=Fast filter-and-refine algorithms for subsequence selection |conference=International Database Engineering an ...various disciplines, particularly in [[information retrieval]], [[database management]], and [[pattern recognition]], which efficiently processes large sets of o ...

...'' is a [[radar]] and [[sonar]] performance enhancement strategy. Tracking algorithms provide the ability to predict future position of multiple moving objects b There are two common algorithms for plot-to-track:<ref>{{cite web|url=http://www.aticourses.com/fundamental ...

...nology, Information Technology, Communication and Control, Environment and Management (HNICEM) | chapter = Performance Comparison of the Teknomo-Fernandez Algori ...ground from background. Once foreground images are extracted, then desired algorithms (such as those for [[Video tracking|motion tracking]], [[Optical motion tra ...

...without it. Use of an AMQ filter for this purpose, however, does increase memory usage.]] ...title = Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms | year = 2005 | pages = 823–829 | contribution-url = http://www.it-c.dk/peo ...

...lemented into industrial-strength real-time and off-line packaged [[Energy management system|EMS]] applications. ...r tools used in [[power system simulation]] and [[Energy management system|management]]. The load-flow equations can be written in the following general form: ...

{{Short description|Type of Knowledge Graph Management System}} == Knowledge graph management systems (KGMS) == ...

...hm''' (LA) is one among the bio-inspired (or) nature-inspired optimization algorithms (or) that are mainly based on meta-heuristic principles. It was first intro ..., Hung JC and Wei J|year=2018|title=Feature selection with modified lion's algorithms and support vector machine for high-dimensional data|url=|journal=Applied S ...

...website=IBM Cloud Object Storage SystemTM Version}}</ref> the Arvados Data Management System,<ref name=":10">{{Cite web |title=Arvados {{!}} Keep clients |url=ht ...d copy at <math>S_k </math> will ultimately be replaced by the local cache management algorithm. If <math>S_k</math> is taken offline, its objects will be remapp ...

...the algorithm above. Blended BBO is based on blended crossover in genetic algorithms,<ref name=Muhlenbein1993/> and has been shown to outperform standard BBO.<r x = zeros(PopulationSize, ProblemDimension); % allocate memory for the population ...

...vector (mathematics)|vector]], a common [[data type]] in [[rasterization]] algorithms, [[2D computer graphics]], [[graphical user interface]] libraries.}} {{defn|A region of [[Memory (computing)|memory]] holding a set of instructions for a [[graphics processing unit]] for rend ...