Sciweavers

3608 search results - page 367 / 722
» computing 2011
Sort
View
ASMTA
2011
Springer
295views Mathematics» more  ASMTA 2011»
14 years 8 months ago
Performance Evaluation of a Single Node with General Arrivals and Service
Queueing delays experienced by packets buffered at a node are among the most difficult to predict when considering the performance of a flow in a network. The arrivals of packets a...
Alexandre Brandwajn, Thomas Begin
CC
2011
Springer
267views System Software» more  CC 2011»
14 years 8 months ago
Using Disjoint Reachability for Parallelization
Abstract. We present a disjoint reachability analysis for Java. Our analysis computes extended points-to graphs annotated with reachability states. Each heap annotated with a set o...
James Christopher Jenista, Yong Hun Eom, Brian Dem...
CCE
2011
14 years 8 months ago
Time representations and mathematical models for process scheduling problems
During the last 15 years, many mathematical models have been developed in order to solve process operation scheduling problems, using discrete or continuous time representations. ...
Sylvain Mouret, Ignacio E. Grossmann, Pierre Pesti...
CIDR
2011
237views Algorithms» more  CIDR 2011»
14 years 8 months ago
Rethinking Database Algorithms for Phase Change Memory
Phase change memory (PCM) is an emerging memory technology with many attractive features: it is non-volatile, byte-addressable, 2–4X denser than DRAM, and orders of magnitude be...
Shimin Chen, Phillip B. Gibbons, Suman Nath
COMPGEOM
2011
ACM
14 years 8 months ago
Zigzag persistent homology in matrix multiplication time
We present a new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of sim...
Nikola Milosavljevic, Dmitriy Morozov, Primoz Skra...