Sciweavers

189 search results - page 2 / 38
» An optimal generalization of the centerpoint theorem, and it...
Sort
View
CADE
2009
Springer
14 years 5 months ago
Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
The inverse method is a generic proof search procedure applicable to non-classical logics satisfying cut elimination and the subformula property. In this paper we describe a genera...
Sean McLaughlin, Frank Pfenning
EUROPAR
2006
Springer
13 years 8 months ago
Surrounding Theorem: Developing Parallel Programs for Matrix-Convolutions
Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, bu...
Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Mas...
GECCO
2008
Springer
127views Optimization» more  GECCO 2008»
13 years 6 months ago
On the possibility to create a compatible--complete unary comparison method for evolutionary multiobjective algorithms
There are several studies on the desirable properties that a performance measure for evolutionary multiobjective algorithms must have. One of these properties is called “compati...
Giovanni Lizárraga Lizárraga, Arturo...
TIP
1998
129views more  TIP 1998»
13 years 4 months ago
Minimax partial distortion competitive learning for optimal codebook design
— The design of the optimal codebook for a given codebook size and input source is a challenging puzzle that remains to be solved. The key problem in optimal codebook design is h...
Ce Zhu, Lai-Man Po
AOSD
2009
ACM
13 years 11 months ago
Dependent advice: a general approach to optimizing history-based aspects
Many aspects for runtime monitoring are history-based: they contain pieces of advice that execute conditionally, based on the observed execution history. History-based aspects are...
Eric Bodden, Feng Chen, Grigore Rosu