Sciweavers

2689 search results - page 38 / 538
» ParalleX: A Study of A New Parallel Computation Model
Sort
View
EUROPAR
2000
Springer
14 years 13 days ago
Novel Models for Or-Parallel Logic Programs: A Performance Analysis
One of the advantages of logic programming is the fact that it offers many sources of implicit parallelism, such as and-parallelism and or-parallelism. Arguably, or-parallel system...
Vítor Santos Costa, Ricardo Rocha, Fernando...
SBMF
2010
Springer
129views Formal Methods» more  SBMF 2010»
13 years 3 months ago
Directed Model Checking for B: An Evaluation and New Techniques
ProB is a model checker for high-level formalisms such as B, Event-B, CSP and Z. ProB uses a mixed depth-first/breadth-first search strategy, and in previous work we have argued th...
Michael Leuschel, Jens Bendisposto
IPPS
1997
IEEE
14 years 1 months ago
A Randomized Sorting Algorithm on the BSP model
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
Alexandros V. Gerbessiotis, Constantinos J. Siniol...
ANOR
2010
116views more  ANOR 2010»
13 years 9 months ago
A model and case study for efficient shelf usage and assortment analysis
In the rapidly changing environment of Fast Moving Consumer Goods sector where new product launches are frequent, retail channels need to reallocate their shelf spaces intelligent...
Mehmet Murat Fadiloglu, Oya Ekin Karasan, Mustafa ...
PODC
2012
ACM
11 years 11 months ago
Weak models of distributed computing, with connections to modal logic
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
Lauri Hella, Matti Järvisalo, Antti Kuusisto,...