Sciweavers

1243 search results - page 33 / 249
» Generating Trees on Multisets
Sort
View
SAS
2009
Springer
175views Formal Methods» more  SAS 2009»
14 years 10 months ago
Automatic Parallelization and Optimization of Programs by Proof Rewriting
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized an...
Clément Hurlin
CL
2000
Springer
14 years 2 months ago
Representing Trees with Constraints
This paper presents a method for representing trees using constraint logic programming over finite domains. We describe a class of trees that is of particular interest to us and h...
Ben Curry, Geraint A. Wiggins, Gillian Hayes
ASPDAC
2005
ACM
98views Hardware» more  ASPDAC 2005»
13 years 12 months ago
Process variation robust clock tree routing
As the minimum feature sizes of VLSI circuits get smaller while the clock frequency increases, the effects of process variations become significant. We propose a UST/DME based ap...
Wai-Ching Douglas Lam, Cheng-Kok Koh
INFORMATICALT
2010
103views more  INFORMATICALT 2010»
13 years 4 months ago
Multistage K-Means Clustering for Scenario Tree Construction
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...
Kristina Sutiene, Dalius Makackas, Henrikas Pranev...
EUROPAR
2007
Springer
14 years 4 months ago
Decision Trees and MPI Collective Algorithm Selection Problem
Selecting the close-to-optimal collective algorithm based on the parameters of the collective call at run time is an important step for achieving good performance of MPI applicatio...
Jelena Pjesivac-Grbovic, George Bosilca, Graham E....