Sciweavers

3690 search results - page 223 / 738
» Computation with classical sequents
Sort
View
102
Voted
HPCC
2010
Springer
15 years 1 months ago
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-Grained Parallelism
This paper presents an algorithm and a data structure for scalable dynamic synchronization in fine-grained parallelism. The algorithm supports the full generality of phasers with d...
Stefan Marr, Stijn Verhaegen, Bruno De Fraine, The...
AMAI
2006
Springer
15 years 24 days ago
Symmetric approximate linear programming for factored MDPs with application to constrained problems
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
Dmitri A. Dolgov, Edmund H. Durfee
IJWGS
2007
96views more  IJWGS 2007»
15 years 19 days ago
The many faces of the integration of instruments and the grid
: Current grid technologies offer unlimited computational power and storage capacity for scientific research and business activities in heterogeneous areas all over the world. Than...
Francesco Lelli, Eric Frizziero, Michele Gulmini, ...
114
Voted
DIS
2010
Springer
14 years 11 months ago
ESTATE: Strategy for Exploring Labeled Spatial Datasets Using Association Analysis
Abstract. We propose an association analysis-based strategy for exploration of multi-attribute spatial datasets possessing naturally arising classification. Proposed strategy, EST...
Tomasz F. Stepinski, Josue Salazar, Wei Ding 0003,...
118
Voted
JACM
2010
116views more  JACM 2010»
14 years 11 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára