Filters








469,576 Hits in 5.1 sec

A Memory Hierarchy Model Based on Data Reuse for Full-Search Motion Estimation on High-Definition Digital Videos

Alba Sandyra Bezerra Lopes, Ivan Saraiva Silva, Luciano Volcan Agostini
2012 International Journal of Reconfigurable Computing  
The external memory bandwidth may be reduced using a memory hierarchy. This work presents a memory hierarchy model for a full-search motion estimation core.  ...  The proposed memory hierarchy model is based on a data reuse scheme considering the full search algorithm features.  ...  The sixth column presents the number of cycles needed to fill a complete local memory with data from a whole search window.  ... 
doi:10.1155/2012/473725 fatcat:hdr6d72nlnddplzt5yydxiyate

Amodal completion in visual working memory

Siyi Chen, Hermann J. Müller, Markus Conci
2016 Journal of Experimental Psychology: Human Perception and Performance  
Finally, with an increase in memory set size, the global object advantage decreased substantially.  ...  Moreover, evidence for completion in VWM was found for composite objects that were interpreted as globally completed wholes, relative to local completions or an uncompleted mosaic (baseline) condition.  ...  This is consistent with previous visual search studies showing that search efficiency is reduced for complete-object representations relative to comparable uncompleted objects (Davis & Driver, 1998; He  ... 
doi:10.1037/xhp0000231 pmid:27019119 fatcat:2g55ywflqresvc44qo5ar7kj4i

On Bootstrapping Local Search with Trail-Markers

Pang C. Chen
1995 International Joint Conference on Artificial Intelligence  
We study a simple, general framework for search called bootstrap search, which is defined as global search using only a local search procedure along with some memory for learning intermediate subgoals.  ...  We also use it to provide some techniques for approximating the optimal resource bound on the local search to achieve the best global search.  ...  Introduction We study a simple, general framework for search called bootstrap search, which is defined as global search using only local search along with some memory for learning intermediate states as  ... 
dblp:conf/ijcai/Chen95 fatcat:lgmcrvus75enznwor5ok2gytly

Parallel Metaheuristic Search [chapter]

Teodor Gabriel Crainic
2018 Handbook of Heuristics  
We present a general picture of the parallel meta-heuristic search for optimization.  ...  display remarkable performances, in particular on asynchronous cooperation and advanced cooperation strategies that create new information out of exchanged data to enhance the global guidance of the search  ...  central memory and interfacing with the Global Search Coordinator.  ... 
doi:10.1007/978-3-319-07124-4_40 fatcat:2hpzacmchre2hbdksb5sgav6ii

DeltaTree

Ibrahim Umar, Otto Johan Anshus, Phuong Hoai Ha
2015 Performance Evaluation Review  
Like other fundamental abstractions for high-performance computing, search trees need to support both high concurrency and data locality.  ...  As a result, DeltaTree minimizes data transfer from memory to CPU and supports high concurrency.  ...  Lemma 2 . 1 . 21 For any upper bound UB on the unknown memory block size B, a search in a complete binary tree with the concurrency-aware vEB layout achieves the optimal memory transfer O(log B N ), where  ... 
doi:10.1145/2796314.2745891 fatcat:yfbpco5m3vbezkgxaxyebytode

Scalable Dynamic Load Balancing Using UPC

Stephen Olivier, Jan Prins
2008 2008 37th International Conference on Parallel Processing  
However, to obtain performance portability with UPC in both shared memory and distributed memory settings requires the careful use of onesided reads and writes to minimize the impact of high latency communication  ...  Parallel implementation of the search requires continuous dynamic load balancing to keep all processors engaged in the search.  ...  This benchmark requires the complete traversal of a large tree-structured search space. The size and imbalance of the search tree is parameterized.  ... 
doi:10.1109/icpp.2008.19 dblp:conf/icpp/OlivierP08 fatcat:wgivv2ozofgjlm6fvlgkuxrqvm

Sample-based learning and search with permanent and transient memories

David Silver, Richard S. Sutton, Martin Müller
2008 Proceedings of the 25th international conference on Machine learning - ICML '08  
Using only the transient memory, Dyna-2 performed at least as well as UCT. Using both memories combined, it significantly outperformed UCT.  ...  We present a reinforcement learning architecture, Dyna-2, that encompasses both samplebased learning and sample-based search, and that generalises across states during both learning and search.  ...  Thus it is natural to compare Dyna-2 with approaches based on α-β search. Dyna-2 combines a permanent memory with a transient memory, using sample-based search.  ... 
doi:10.1145/1390156.1390278 dblp:conf/icml/SilverSM08 fatcat:2rv6xrt6rfhm7b2bhdrs3zazji

Amodal Completion of a Target Template Enhances Attentional Guidance in Visual Search

Siyi Chen, Lucas Schnabl, Hermann J. Müller, Markus Conci
2018 i-Perception  
Overall, these findings suggest that attentional guidance in visual search may be based on a target "template" that represents a globally completed image of the occluded (target) object in accordance with  ...  When searching for a target object in cluttered environments, our visual system appears to complete missing parts of occluded objects-a mechanism known as "amodal completion."  ...  In line with previous findings in a working memory task (Chen et al., 2016 , priming by the simple-object context led to an increased search efficiency for the globally completed (composite) objects-indicating  ... 
doi:10.1177/2041669518796240 pmid:30186587 pmcid:PMC6117868 fatcat:4r3flb5kszbwxo5y7g6xdcitoq

Using coefficient K to distinguish ambient/focal visual attention during map viewing [article]

Niedzielska, Anna; National Information Processing Institute, Poland, Krejtz, Krzysztof; SWPS University Of Social Sciences And Humanities, Coltekin, Arzu; Department Of Geography, University Of Zurich, Duchowski, Andrew; Clemson University
2017 Journal of Eye Movement Research  
Evaluation of Κ elucidates task dependence of ambient/focal attention dynamics when working with geographic visualizations: localization progresses from ambient to focal attention; route planning fluctuates  ...  in an ambient-focalambient pattern characteristic of the three stages of route end point localization, route following, and route confirmation.  ...  Presumably, working memory serves as facilitator of visual search which dominates localization on a cartographic map.  ... 
doi:10.16910/jemr.10.2.3 pmid:33828650 pmcid:PMC7141058 fatcat:yhz7tebyxnhrtjw4ljni2ovnpe

Dynamic search and working memory in social recall

Thomas T. Hills, Thorsten Pachur
2012 Journal of Experimental Psychology. Learning, Memory and Cognition  
Do the search mechanisms involve dynamic local-to-global transitions similar to semantic search, and are these transitions governed by the general control of attention, associated with working memory span  ...  Moreover, individual differences in the time between transitions were positively correlated with differences in working memory capacity.  ...  Klein, Cosmides, Tooby, & Chance, 2002) , social memory may indeed not completely overlap with other forms of memory, such as semantic memory.  ... 
doi:10.1037/a0025161 pmid:21859235 fatcat:ng2v5gmrrbhtzh676t7qa2sgue

Swapping evaluation: A memory-scalable solution for answer-on-demand tabling

PABLO CHICO DE GUZM'AN, MANUEL CARRO, DAVID S. WARREN
2010 Theory and Practice of Logic Programming  
Swapping evaluation also returns answers one by one before completing a tabled call, but its memory usage can be orders of magnitude less than batched evaluation.  ...  Some programs which in practice can be executed under the local strategy quickly run out of memory under batched evaluation.  ...  The swapping evaluation strategy proposed in this paper is a depthfirst search strategy that has memory performance much closer to local scheduling.  ... 
doi:10.1017/s1471068410000189 fatcat:rszfx2mfy5dsxgqe7v5qisrvxy

Swapping Evaluation: A Memory-Scalable Solution for Answer-On-Demand Tabling [article]

Pablo Chico de Guzman, Manuel Carro, David S. Warren
2010 arXiv   pre-print
Swapping evaluation also returns answers one by one before completing a tabled call, but its memory usage can be orders of magnitude less than batched evaluation.  ...  Some programs which in practice can be executed under the local strategy quickly run out of memory under batched evaluation.  ...  The swapping evaluation strategy proposed in this paper is a depthfirst search strategy that has memory performance much closer to local scheduling.  ... 
arXiv:1007.3961v1 fatcat:ptpa2axe25btlexzkhkz5yq4la

Adaptive memory programming: A unified view of metaheuristics

Éric D Taillard, Luca M Gambardella, Michel Gendreau, Jean-Yves Potvin
2001 European Journal of Operational Research  
The paper analyses recent developments of a number of memory-based metaheuristics such as taboo search (TS), scatter search (SS), genetic algorithms (GA) and ant colonies.  ...  So, a uni®ed presentation is proposed under the name of adaptive memory programming (AMP).  ...  solution with the information stored in memory; third, they apply a local search method, like a local search improvement method, an elementary TS or SA to improve the initial solution.  ... 
doi:10.1016/s0377-2217(00)00268-x fatcat:3dmwe5wkofhk5jkiqqm4wg6u7a

GPU merge path

Oded Green, Robert McColl, David A. Bader
2012 Proceedings of the 26th ACM international conference on Supercomputing - ICS '12  
certain types of memory access patterns.  ...  The new algorithm demonstrates good utilization of the GPU memory hierarchy.  ...  The thread block reads 512 elements cooperatively from each array into local shared memory, performs the cross diagonal search on this smaller problem in local shared memory, then cooperatively writes  ... 
doi:10.1145/2304576.2304621 dblp:conf/ics/GreenMB12 fatcat:hfcvue7qfnhllfrd2t4g7zotpu

SMT-Directory: Efficient Load-Load Ordering for SMT

Andrew Hilton, Amir Roth
2010 IEEE computer architecture letters  
As a result, local store completions trigger searches only for data that is actually shared.  ...  Stores that complete-i.e., write to the cache-in one core trigger load queue searches in the other cores.  ...  Figure 3 shows SMT-Directory operating in conjunction with load queue search. We extend the data cache with SMT-Directory bits.  ... 
doi:10.1109/l-ca.2010.8 fatcat:hw4zcn6vyvdzrktvmuoya6vcxq
« Previous Showing results 1 — 15 out of 469,576 results