Sciweavers

587 search results - page 95 / 118
» Improving the Java memory model using CRF
Sort
View
114
Voted
ICPP
2005
IEEE
15 years 7 months ago
Optimizing Collective Communications on SMP Clusters
We describe a generic programming model to design collective communications on SMP clusters. The programming model utilizes shared memory for collective communications and overlap...
Meng-Shiou Wu, Ricky A. Kendall, Kyle Wright
121
Voted
ECML
1991
Springer
15 years 5 months ago
Learning by Analogical Replay in PRODIGY: First Results
Robust reasoning requires learning from problem solving episodes. Past experience must be compiled to provide adaptation to new contingencies and intelligent modification of solut...
Manuela M. Veloso, Jaime G. Carbonell
111
Voted
STORYTELLING
2007
Springer
15 years 8 months ago
Wide Ruled: A Friendly Interface to Author-Goal Based Story Generation
We present Wide Ruled, an authoring tool for the creation of generative stories. It is based on the Universe author-goal-based model of story generation, and extends this model by ...
James Skorupski, Lakshmi Jayapalan, Sheena Marquez...
EDBT
2010
ACM
151views Database» more  EDBT 2010»
15 years 7 months ago
Warm cache costing: a feedback optimization technique for buffer pool aware costing
Most modern RDBMS depend on the query processing optimizer’s cost model to choose the best execution plan for a given query. Since the physical IO (PIO) is a costly operation to...
H. S. Ramanujam, Edwin Seputis
SPAA
1995
ACM
15 years 5 months ago
Parallel Sorting with Limited Bandwidth
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
Micah Adler, John W. Byers, Richard M. Karp