Sciweavers

1714 search results - page 230 / 343
» Abstract Models of Memory Management
Sort
View
SODA
2004
ACM
104views Algorithms» more  SODA 2004»
15 years 8 months ago
Tight bounds for the partial-sums problem
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
Mihai Patrascu, Erik D. Demaine
TC
2008
15 years 7 months ago
Optimal and Practical Algorithms for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
JLP
2007
99views more  JLP 2007»
15 years 7 months ago
Resources in process algebra
The algebra of communicating shared resources (ACSR) is a timed process algebra which extends classical process algebras with the notion of a resource. It takes the view that the ...
Insup Lee, Anna Philippou, Oleg Sokolsky
CORR
2004
Springer
101views Education» more  CORR 2004»
15 years 7 months ago
Parallel Computing Environments and Methods for Power Distribution System Simulation
Abstract -- The development of cost-effective highperformance parallel computing on multi-processor supercomputers makes it attractive to port excessively time consuming simulation...
Ning Lu, Z. Todd Taylor, David P. Chassin, Ross T....
187
Voted
ENTCS
2000
112views more  ENTCS 2000»
15 years 7 months ago
Typed Multiset Rewriting Specifications of Security Protocols
The language MSR has successfully been used in the past to prove undecidability about security protocols modeled according to the Dolev-Yao abstraction. In this paper, we revise t...
Iliano Cervesato