Filters








5,277 Hits in 5.7 sec

Page 7324 of Mathematical Reviews Vol. , Issue 2000j [page]

2000 Mathematical Reviews  
Williamson, A primal-dual schema based approximation algorithm for the element connectivity problem (484-489); Klaus Jansen and Lorant Porkolab, Linear-time ap- proximation schemes for scheduling malleable  ...  Henzinger and Stefano Leonardi, Schedul- ing multicasts on unit-capacity trees and meshes (438-447); Stefan Hougardy and Hans Jirgen Prémel, A 1.598 approximation algo- rithm for the Steiner problem in  ... 

A fast analytical model of fully associative caches

Tobias Gysi, Tobias Grosser, Laurin Brandner, Torsten Hoefler
2019 Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2019  
We present a lightweight cache model for fully associative caches with least recently used (LRU) replacement policy that gives fast and accurate results.  ...  Our cache model often computes the results within seconds and contrary to simulation the execution time is mostly problem size independent.  ...  We also would like to thank the Swiss National Supercomputing Center for providing the computing resources.  ... 
doi:10.1145/3314221.3314606 dblp:conf/pldi/GysiGBH19 fatcat:v53rr5ds3fdtpnsnmgnjl7cfmi

Rendering complex scenes with memory-coherent ray tracing

Matt Pharr, Craig Kolb, Reid Gershbein, Pat Hanrahan
1997 Proceedings of the 24th annual conference on Computer graphics and interactive techniques - SIGGRAPH '97  
We have developed algorithms that use caching and lazy creation of texture and geometry to manage scene complexity.  ...  Simulating realistic lighting and rendering complex scenes are usually considered separate problems with incompatible solutions.  ...  Background Previously developed techniques that address the problems of rendering complex scenes include culling algorithms, lazy evaluation and caching, and reordering independent parts of a computation  ... 
doi:10.1145/258734.258791 dblp:conf/siggraph/PharrKGH97 fatcat:zl6rc4pbqjbjrj4x7v442ddzxa

Page 4174 of Mathematical Reviews Vol. , Issue 2001F [page]

2001 Mathematical Reviews  
Piotr Indyk, Sublinear time algorithms for metric space prob- lems (428—432 (electronic)); Allan Borodin, Rafail Ostrovsky and Yuval Rabani, Subquadratic approximation algorithms for cluster- ing problems  ...  for cache replacement (109-118 (electronic)).  ... 

Page 7054 of Mathematical Reviews Vol. , Issue 2003i [page]

2003 Mathematical Reviews  
, Sanjeev Khanna and Joseph Naor, A deterministic algorithm for the cost-distance problem (232-233); Yunhong Zhou and Subhash Suri, Shape sensitive geometric per- mutations (234-243); Yingping Huang, Jinhui  ...  Johnson and Claire Kenyon, Better approximation algorithms for bin covering (557-566); Aravind Srinivasan, New approaches to covering and packing problems (567-576); Daniel W.  ... 

Page 2767 of Mathematical Reviews Vol. , Issue 2002D [page]

2002 Mathematical Reviews  
Carr], Toshihiro Fujito, Goran Konjevod and Ojas Parekh, A 2,4-approximation algorithm for a generaliza- tion of the weighted edge-dominating set problem (132-142); A. E. F. Clementi, A.  ...  revis- ited (202-210); Daya Ram Gaur, Toshihide Ibaraki and Ramesh Krishnamurti, Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning prob- lem (  ... 

Book reports

1993 Computers and Mathematics with Applications  
An expert system approach for economic evaluation of machining operation planning. II. Scheduling and control. 7. Interactive problem solving for production plmming. 8.  ...  An abstraction-ba~d search and learning approach for effective scheduling. 9. ADDYMS: Architecture for distributed dynamic manufacturing scheduling. 10.  ... 
doi:10.1016/0898-1221(93)90315-m fatcat:tnmkz3axfnekvgr4srsgsivuvy

Joint Optimization of File Placement and Delivery in Cache-Assisted Wireless Networks with Limited Lifetime and Cache Space

Bojie Lv, Rui Wang, Ying Cui, Yi Gong, Haisheng Tan
2020 IEEE Transactions on Communications  
One reinforcement learning algorithm is proposed for the scenario where these statistics are unknown.  ...  In this paper, the scheduling of downlink file transmission in one cell with the assistance of cache nodes with finite cache space is studied.  ...  as single-file scheduling problem.  ... 
doi:10.1109/tcomm.2020.2966454 fatcat:c56lidjx7zbu5k3trstyq7svuu

Volume TOC

2003 Journal of computer and system sciences (Print)  
1 A simple reduction of non-uniformity in dynamic load balancing of quantized loads on hypercube multiprocessors and hiding balancing overheads Hwakyung Rim, Ju-wook Jang, and Sungchun Kim 26 Stability  ...  of long-lived consensus Shlomi Dolev and Sergio Rajsbaum 46 On parallel attribute-efficient learning Peter Damaschke  ...  92 Connection caching: model and algorithms Edith Cohen, Haim Kaplan, and Uri Zwick 127 Proof theory of higher-order equations: conservativity, normal forms and term rewriting K.  ... 
doi:10.1016/s0022-0000(03)00171-5 fatcat:b3y3lx5ns5fkzbas6avryukd7q

Excel Solvers for the Traveling Salesman Problem

Mangesh Gharote, Dilys Thomas, Sachin Lodha
2012 International Conference on Management of Data  
We give algorithms for the query sequencing problem that scale (small space) and are efficient (low runtime) as compared to earlier work [4] .  ...  The errors are small in practice and we are able to further reduce them using geometric repair.  ...  Acknowledgements: Metaheuristics were developed with help from Prem Nathan, Prashant Kumar and Sani Kumbhar. Dr. Maitreya Natu provided the SAP workload. Dr.  ... 
dblp:conf/comad/GharoteTL12 fatcat:64mr4q6l2nbhbk4gqukazr7xoy

The Geometry of Scheduling

Nikhil Bansal, Kirk Pruhs
2014 SIAM journal on computing (Print)  
These results are obtained by reducing the scheduling problem to a geometric capacitated set cover problem in two dimensions.  ...  Introduction We consider the following general offline scheduling problem: General Scheduling Problem (GSP): The input consists of a collection of n jobs, and for each job j there is a positive integer  ...  Acknowledgments We greatly thank Alexander Souza, Cliff Stein, Lap-Kei Lee, Ho-Leung Chan, and Pan Jiangwei for several discussions about this research.  ... 
doi:10.1137/130911317 fatcat:bzz2xa6asnha3a3i3sozlmjb34

The Geometry of Scheduling

Nikhil Bansal, Kirk Pruhs
2010 2010 IEEE 51st Annual Symposium on Foundations of Computer Science  
These results are obtained by reducing the scheduling problem to a geometric capacitated set cover problem in two dimensions.  ...  Introduction We consider the following general offline scheduling problem: General Scheduling Problem (GSP): The input consists of a collection of n jobs, and for each job j there is a positive integer  ...  Acknowledgments We greatly thank Alexander Souza, Cliff Stein, Lap-Kei Lee, Ho-Leung Chan, and Pan Jiangwei for several discussions about this research.  ... 
doi:10.1109/focs.2010.46 dblp:conf/focs/BansalP10 fatcat:oo6s433zsbaqrlq3zqlpaik3na

Fast Rendering for a Multifinger Haptic Display

Blake Hannaford, Rainer Leuschke
2007 Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (WHC'07)  
The algorithm uses a human-defined geometrical map to quickly cache surface triangles for constant time solution of the collision detection problem.  ...  An algorithm is described for fast rendering of surfaces for haptic interaction with multiple fingers.  ...  The authers would also like to thank Bill McNeely for fruitful discussions.  ... 
doi:10.1109/whc.2007.52 dblp:conf/haptics/HannafordL07 fatcat:nijvwbb4m5fcbcvmtj4ir5vzb4

Balanced Partitioning of Several Cache-Oblivious Algorithms [article]

Yuan Tang, Weiguo Gao
2020 arXiv   pre-print
Frigo et al. proposed an ideal cache model and a recursive technique to design sequential cache-efficient algorithms in a cache-oblivious fashion.  ...  We demonstrate our approach on several important cache-oblivious algorithms, including LCS, 1D, GAP, classic rectangular matrix multiplication on a semiring, and Strassen's algorithm.  ...  Cole and Ramachandran [2] , [6] proved an O(n 3 /(L √ Z) + (p log p) 1/3 · n 2 /L + p log p) overall parallel cache complexity for a resource-oblivious algorithm scheduled by a centralized scheduler  ... 
arXiv:2011.01441v1 fatcat:l7pe3zjul5g7pjtlsx34zt7or4

Computational Methods for the Parallel 3D Simulation of Biochemical Kinetics at the Microscopic Scale [chapter]

Laurent Crépin, Fabrice Harrouet, Sébastien Kerdélo, Jacques Tisseau, Pascal Redou
2013 Lecture Notes in Computer Science  
Therefore, we propose a model that is suitable for parallel computing and that can especially take advantage of recent multicore and multiprocessor architectures.  ...  Comparisons between simulations and theoretical results are exposed, as well as a performance evaluation of our algorithms.  ...  Then, we describe the cache-aware simulation engine and the parallel computing algorithms that we developed for performance purpose.  ... 
doi:10.1007/978-3-642-38036-5_7 fatcat:vkqqd4worng35c7udziyrpx5mu
« Previous Showing results 1 — 15 out of 5,277 results