Sciweavers

IPL
2008
95views more  IPL 2008»
13 years 9 months ago
Approximating maximum satisfiable subsystems of linear equations of bounded width
We consider the problem known as MAX-SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of...
Zeev Nutov, Daniel Reichman
DAM
2006
68views more  DAM 2006»
13 years 9 months ago
A strongly polynomial algorithm for solving two-sided linear systems in max-algebra
An algorithm for solving m
Peter Butkovic, Karel Zimmermann
CORR
2006
Springer
116views Education» more  CORR 2006»
13 years 9 months ago
Rewriting modulo in Deduction modulo
Abstract. We study the termination of rewriting modulo a set of equations in the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions a...
Frédéric Blanqui
AMC
2007
65views more  AMC 2007»
13 years 9 months ago
Asymptotic behavior of second-order dynamic equations
We prove several growth theorems for second-order dynamic equations on time scales. These theorems contain as special cases results for second-order differential equations, diff...
Martin Bohner, Stevo Stevic
RTA
1993
Springer
14 years 1 months ago
Redundancy Criteria for Constrained Completion
This paper studies completion in the case of equations with constraints consisting of rstorder formulae over equations, disequations, and an irreducibility predicate. We present s...
Christopher Lynch, Wayne Snyder
PLILP
1993
Springer
14 years 1 months ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...
DATE
2010
IEEE
148views Hardware» more  DATE 2010»
14 years 2 months ago
Intent-leveraged optimization of analog circuits via homotopy
—This paper proposes a circuit optimization approach that can ease the computational burden on the simulation-based circuit optimizers by leveraging simple design equations that ...
Metha Jeeradit, Jaeha Kim, Mark Horowitz
SAS
2004
Springer
103views Formal Methods» more  SAS 2004»
14 years 2 months ago
A Scalable Nonuniform Pointer Analysis for Embedded Programs
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
Arnaud Venet
MFCS
2004
Springer
14 years 2 months ago
Decidability of Trajectory-Based Equations
We consider the decidability of existence of solutions to language equations involving the operations of shuffle and deletion along trajectories. These operations generalize the o...
Michael Domaratzki, Kai Salomaa
IFIP
2004
Springer
14 years 2 months ago
Looking Inside AES and BES
We analyze an algebraic representation of AES–128 as an embedding in BES, due to Murphy and Robshaw. We present two systems of equations S and K concerning encryption and key gen...
Ilia Toli, Alberto Zanoni