Sciweavers

1749 search results - page 159 / 350
» Logic, Optimization, and Constraint Programming
Sort
View
PLDI
2004
ACM
14 years 1 months ago
Vectorization for SIMD architectures with alignment constraints
When vectorizing for SIMD architectures that are commonly employed by today’s multimedia extensions, one of the new challenges that arise is the handling of memory alignment. Pr...
Alexandre E. Eichenberger, Peng Wu, Kevin O'Brien
POPL
2006
ACM
14 years 8 months ago
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...
Xavier Leroy
AAECC
1999
Springer
82views Algorithms» more  AAECC 1999»
13 years 7 months ago
Reasoning over Networks by Symbolic Methods
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
Thomas Sturm
CP
2009
Springer
14 years 3 months ago
Dialectic Search
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it...
Serdar Kadioglu, Meinolf Sellmann
DLOG
2007
13 years 10 months ago
Optimizing Tableau Reasoning in ALC Extended with Uncertainty
Abstract. There has been an increased interest in recent years to incorporate uncertainty in Description Logics (DLs), and a number of proposals have been put forward for modeling ...
Volker Haarslev, Hsueh-Ieng Pai, Nematollaah Shiri