Sciweavers

3872 search results - page 139 / 775
» The Java memory model
Sort
View
124
Voted
AAAI
2006
15 years 4 months ago
Memory Intensive Branch-and-Bound Search for Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sens...
Radu Marinescu 0002, Rina Dechter
124
Voted
EMNLP
2010
15 years 17 days ago
Storing the Web in Memory: Space Efficient Language Models with Constant Time Retrieval
We present three novel methods of compactly storing very large n-gram language models. These methods use substantially less space than all known approaches and allow n-gram probab...
David Guthrie, Mark Hepple
CC
2001
Springer
121views System Software» more  CC 2001»
15 years 7 months ago
Constant-Time Root Scanning for Deterministic Garbage Collection
Root scanning is the task of identifying references to heap objects that are stored outside of the heap itself, in global and local variables and on the execution stack. Root scann...
Fridtjof Siebert
142
Voted
JAVA
2001
Springer
15 years 7 months ago
Sapphire: copying GC without stopping the world
Many concurrent garbage collection (GC) algorithms have been devised, but few have been implemented and evaluated, particularly for the Java programming language. Sapphire is an a...
Richard L. Hudson, J. Eliot B. Moss
ICA3PP
2005
Springer
15 years 8 months ago
Analytical Models of Probability Distributions for MPI Point-to-Point Communication Times on Distributed Memory Parallel Compute
Abstract. Measurement and modelling of distributions of data communication times is commonly done for telecommunication networks, but this has not previously been done for message ...
Duncan A. Grove, Paul D. Coddington