Sciweavers

2465 search results - page 33 / 493
» Automata on Linear Orderings
Sort
View
ADBIS
2004
Springer
193views Database» more  ADBIS 2004»
13 years 11 months ago
Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
Peter Z. Revesz
SCALESPACE
2005
Springer
14 years 1 months ago
Regularity and Scale-Space Properties of Fractional High Order Linear Filtering
We investigate the use of fractional powers of the Laplacian for signal and image simplification. We focus both on their corresponding variational techniques and parabolic pseudod...
Stephan Didas, Bernhard Burgeth, Atsushi Imiya, Jo...
APAL
2006
75views more  APAL 2006»
13 years 7 months ago
On self-embeddings of computable linear orderings
The Dushnik
Rodney G. Downey, Carl G. Jockusch Jr., Joseph S. ...
GECCO
2003
Springer
122views Optimization» more  GECCO 2003»
14 years 29 days ago
Designing A Hybrid Genetic Algorithm for the Linear Ordering Problem
The Linear Ordering Problem(LOP), which is a well-known NP-hard problem, has numerous applications in various fields. Using this problem as an example, we illustrate a general pro...
Gaofeng Huang, Andrew Lim
AISC
2008
Springer
13 years 9 months ago
Parametric Linear Arithmetic over Ordered Fields in Isabelle/HOL
We use higher-order logic to verify a quantifier elimination procedure for linear arithmetic over ordered fields, where the coefficients of variables are multivariate polynomials o...
Amine Chaieb