Filters








77,477 Hits in 9.7 sec

Theory and Practice of Time-Space Trade-Offs in Memory Limited Search [chapter]

Stefan Edelkamp, Ulrich Meyer
2001 Lecture Notes in Computer Science  
We present theoretical and practical results on new variants for exploring state-space with respect to memory limitations.  ...  Having to cope with memory limitations is an ubiquitous issue in heuristic search.  ...  The work is partially supported by the IST Programme of the EU under contract number IST-1999-14186 (ALCOM-FT) and by DFG within the project Heuristic Search and Its Application to Protocol Validation.  ... 
doi:10.1007/3-540-45422-5_13 fatcat:qgu2gp3xqzbanae34w4eu46q3a

Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers [chapter]

Jan Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordström, Marc Vinyals
2016 Lecture Notes in Computer Science  
We show how previously established strong size-space trade-offs for resolution can be transformed into equally strong trade-offs between time and memory usage for CDCL, where the upper bounds hold for  ...  A long line of research has studied the power of conflictdriven clause learning (CDCL) and how it compares to the resolution proof system in which it searches for proofs.  ...  The third author performed this work while at KTH Royal Institute of Technology, and most of the work of the second and fourth author was done while visiting KTH.  ... 
doi:10.1007/978-3-319-40970-2_11 fatcat:4jiqks3o7rgsrim2njfx36rt54

On the Role of Working Memory in Trading-Off Skills and Situation Awareness in Sudoku [chapter]

George Leu, Jiangjun Tang, Hussein Abbass
2014 Lecture Notes in Computer Science  
In the meantime, and practically, it is vital when analysing the mental processes involved in safety-critical domains. In this paper, we use the Sudoku game as a vehicle to study this trade-off.  ...  Working memory accounts for the ability of humans to perform cognitive processing, by handling both the representation of information (the mental picture forming the situation awareness) and the space  ...  This is a pre-print of an article published in Lecture Notes in Computer Science, vol 8836, Springer.  ... 
doi:10.1007/978-3-319-12643-2_69 fatcat:jsozmdfe75caphpk2m3vp7ltnu

Evaluation of hardware-firmware-software trade-offs with mathematical modeling

H. Barsamian, A. DeCegama
1971 Proceedings of the May 18-20, 1971, spring joint computer conference on - AFIPS '71 (Spring)  
ACKNOWLEDGMENTS The cooperation and encouragement offered by the NCR-DPD Research Department has been instrumental in the preparation of this paper.  ...  Hanlon and Mrs. V. J. Miller for their valuable suggestions and editorial efforts. Mmes. A. Peralta's and E. Mackay's contributions in typing this paper deserve a full-hearted thanks from the authors.  ...  The limitation in performance that can be observed from the leveling off of the curves is due to a main memory bottleneck for the smaller memory system and to a disk system bottleneck for the larger memory  ... 
doi:10.1145/1478786.1478809 dblp:conf/afips/BarsamianD71 fatcat:cc6t5ywtyrcuzmjkxikcy63vlu

Time-Memory Trade-Offs: False Alarm Detection Using Checkpoints [chapter]

Gildas Avoine, Pascal Junod, Philippe Oechslin
2005 Lecture Notes in Computer Science  
In this paper, we also present theoretical analysis of time-memory trade-offs, and give a complete characterization of the variant based on rainbow tables.  ...  Since the original publication of Martin Hellman's cryptanalytic time-memory trade-off, a few improvements on the method have been suggested.  ...  Introduction Many cryptanalytic problems can be solved in theory using an exhaustive search in the key space, but are still hard to solve in practice because each new instance of the problem requires to  ... 
doi:10.1007/11596219_15 fatcat:ozcrrb7zgvb2vpupshsc62bxsm

Space-time trade-off optimization for a class of electronic structure calculations

Daniel Cociorva, Gerald Baumgartner, Chi-Chung Lam, P. Sadayappan, J. Ramanujam, Marcel Nooijen, David E. Bernholdt, Robert Harrison
2002 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation - PLDI '02  
In this paper, we present an algorithm that starts with an operationminimal form of the computation and systematically explores the possible space-time trade-offs to identify the form with lowest cost  ...  that fits within a specified memory limit.  ...  In this paper, we develop a two-step search strategy for exploration of the space-time trade-off: Search among all possible ways of introducing redundant loop indices in the fusion graph to reduce memory  ... 
doi:10.1145/512549.512551 fatcat:y3zuziytzjallmtgysjt2472dq

Space-time trade-off optimization for a class of electronic structure calculations

Daniel Cociorva, Gerald Baumgartner, Chi-Chung Lam, P. Sadayappan, J. Ramanujam, Marcel Nooijen, David E. Bernholdt, Robert Harrison
2002 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation - PLDI '02  
In this paper, we present an algorithm that starts with an operationminimal form of the computation and systematically explores the possible space-time trade-offs to identify the form with lowest cost  ...  that fits within a specified memory limit.  ...  In this paper, we develop a two-step search strategy for exploration of the space-time trade-off: Search among all possible ways of introducing redundant loop indices in the fusion graph to reduce memory  ... 
doi:10.1145/512529.512551 dblp:conf/pldi/CociorvaBLSRNBH02 fatcat:hdy6zbuuhrggjf7kwlalazbcmi

Space-time trade-off optimization for a class of electronic structure calculations

Daniel Cociorva, Gerald Baumgartner, Chi-Chung Lam, P. Sadayappan, J. Ramanujam, Marcel Nooijen, David E. Bernholdt, Robert Harrison
2002 SIGPLAN notices  
In this paper, we present an algorithm that starts with an operationminimal form of the computation and systematically explores the possible space-time trade-offs to identify the form with lowest cost  ...  that fits within a specified memory limit.  ...  In this paper, we develop a two-step search strategy for exploration of the space-time trade-off: Search among all possible ways of introducing redundant loop indices in the fusion graph to reduce memory  ... 
doi:10.1145/543552.512551 fatcat:dotf2cim75e3vftocdzhc3hvki

Characterization and Improvement of Time-Memory Trade-Off Based on Perfect Tables

Gildas Avoine, Pascal Junod, Philippe Oechslin
2008 ACM Transactions on Privacy and Security  
The idea of a time-memory trade-off is to find a trade-off between the exhaustive search and the exhaustive storage.  ...  Cryptanalytic time-memory trade-offs have been introduced in 1980 by Hellman [Hellman 1980 ] and applied to DES.  ...  INTRODUCTION Many cryptanalytic problems can be solved in theory using an exhaustive search in the key space, but are still hard to solve in practice because each new instance of the problem requires to  ... 
doi:10.1145/1380564.1380565 fatcat:tmo3dvtinrd2bbkuhmrapolgxm

Prospects and limitations of full-text index structures in genome analysis

M. Vyverman, B. De Baets, V. Fack, P. Dawyndt
2012 Nucleic Acids Research  
Moreover, the last decade has seen a boom in the number of variant index structures featuring complex and diverse memory-time trade-offs.  ...  Their features, interrelationships, the trade-offs they impose, but also their practical limitations, are explained and compared.  ...  In addition, the authors would also like to thank the editor and the anonymous reviewers for their valuable comments and suggestions to improve the quality of the manuscript.  ... 
doi:10.1093/nar/gks408 pmid:22584621 pmcid:PMC3424560 fatcat:5sfziui7ujhfzcqhcukbi4utjq

Developmental Dyslexia: Disorder or Specialization in Exploration?

Helen Taylor, Martin David Vestergaard
2022 Frontiers in Psychology  
We re-examine experimental studies in psychology and neuroscience using the framework of cognitive search, whereby many psychological processes involve a trade-off between exploration and exploitation.  ...  Evidence for search specialization suggests that, as with some other social organisms, humans mediate the exploration–exploitation trade-off by specializing in complementary strategies.  ...  in bringing this project to fruition, Professor Richard Potts for kindly providing the image used, Elizabeth Gasson for helpful feedback on previous approaches and Brock and Fernette Eide for advice and  ... 
doi:10.3389/fpsyg.2022.889245 pmid:35814102 pmcid:PMC9263984 fatcat:v6sli7xg3jband22wd5oaylcnm

Memory and Organizational Evolvability in a Neutral Landscape

Amit Jain, Bruce Kogut
2014 Organization science (Providence, R.I.)  
Innovative search in the adaptive biology tradition leads quickly to dead ends. However, memory is useful for rendering innovative search more efficient.  ...  M any organizational theories are not sanguine over the chances of organizations to adapt and evolve, even if they should learn from the past through memory.  ...  Acknowledgments The authors thank INSEAD, the National University of Singapore [Grants R-535-000-005-133 and R-313-000-090-133], and the Sanford C. Bernstein & Co.  ... 
doi:10.1287/orsc.2013.0841 fatcat:ks2gybp4ofhd7kqsyfzcbwhwk4

Partial Order Pruning: for Best Speed/Accuracy Trade-off in Neural Architecture Search [article]

Xin Li, Yiming Zhou, Zheng Pan, Jiashi Feng
2019 arXiv   pre-print
By further searching decoder architectures, our DF-Seg real-time segmentation networks yield state-of-the-art speed/accuracy trade-off on both the target embedded device and the high-end GPU.  ...  It prunes the architecture search space with a partial order assumption to automatically search for the architectures with the best speed and accuracy trade-off.  ...  Acknowledgement Jiashi Feng was partially supported by NUS IDS R-263-000-C67-646, ECRA R-263-000-C87-133 and MOE Tier-II R-263-000-D17-112.  ... 
arXiv:1903.03777v2 fatcat:scd3fpkvjzbibpo64ckzr766bi

Partial Order Pruning: For Best Speed/Accuracy Trade-Off in Neural Architecture Search

Xin Li, Yiming Zhou, Zheng Pan, Jiashi Feng
2019 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)  
By further searching decoder architectures, our DF-Seg real-time segmentation networks yield state-of-the-art speed/accuracy trade-off on both the target embedded device and the high-end GPU.  ...  It prunes the architecture search space with a partial order assumption to automatically search for the architectures with the best speed and accuracy trade-off.  ...  Acknowledgement Jiashi Feng was partially supported by NUS IDS R-263-000-C67-646, ECRA R-263-000-C87-133 and MOE Tier-II R-263-000-D17-112.  ... 
doi:10.1109/cvpr.2019.00936 dblp:conf/cvpr/LiZPF19 fatcat:gki5cmialbfk5n43rzfcachtrm

Nearest neighbor decoding for Tardos fingerprinting codes [article]

Thijs Laarhoven
2019 arXiv   pre-print
) nearest neighbor searching to obtain decoding times which are sublinear in the total number of users.  ...  In this paper we show how to model the decoding step of score-based fingerprinting as a nearest neighbor search problem, and how this relation allows us to apply techniques from the field of (approximate  ...  ACKNOWLEDGMENTS The author thanks Peter Roelse for discussions on the potential relevance of these techniques. The author is supported by an NWO Veni Grant under project number 016.Veni.192.005.  ... 
arXiv:1902.06196v1 fatcat:z4mp6qw6pna23clm4ytqzjjqli
« Previous Showing results 1 — 15 out of 77,477 results