Sciweavers

298 search results - page 43 / 60
» Abstract Models of Transfinite Reductions
Sort
View
FMCAD
2006
Springer
15 years 1 months ago
Finite Instantiations for Integer Difference Logic
The last few years have seen the advent of a new breed of decision procedures for various fragments of first-order logic based on ional abstraction. A lazy satisfiability checker ...
Hyondeuk Kim, Fabio Somenzi
ESOP
2008
Springer
14 years 12 months ago
Open Bisimulation for the Concurrent Constraint Pi-Calculus
Abstract. The concurrent constraint pi-calculus (cc-pi-calculus) has been introduced as a model for concluding Service Level Agreements. The cc-pi calculus combines the synchronous...
Maria Grazia Buscemi, Ugo Montanari
ANOR
2010
135views more  ANOR 2010»
14 years 10 months ago
A framework of irregularity enlightenment for data pre-processing in data mining
Abstract Irregularities are widespread in large databases and often lead to erroneous conclusions with respect to data mining and statistical analysis. For example, considerable bi...
Siu-Tong Au, Rong Duan, Siamak G. Hesar, Wei Jiang
93
Voted
PAAPP
2006
141views more  PAAPP 2006»
14 years 10 months ago
Algorithmic optimizations of a conjugate gradient solver on shared memory architectures
OpenMP is an architecture-independent language for programming in the shared memory model. OpenMP is designed to be simple and in terms of programming abstractions. Unfortunately,...
Henrik Löf, Jarmo Rantakokko
TOPLAS
1998
133views more  TOPLAS 1998»
14 years 9 months ago
A Systematic Study of Functional Language Implementations
Abstract: We introduce a unified framework to describe, relate, compare and classify functional language implementations. The compilation process is expressed as a succession of p...
Rémi Douence, Pascal Fradet