Sciweavers

503 search results - page 14 / 101
» Equality In Lazy Computation Systems
Sort
View
TSP
2010
13 years 4 months ago
Low complexity equalization for doubly selective channels modeled by a basis expansion
We propose a novel equalization method for doubly selective wireless channels, whose taps are represented by an arbitrary Basis Expansion Model (BEM). We view such a channel in the...
Tomasz Hrycak, Saptarshi Das, Gerald Matz, Hans G....
RC
2002
100views more  RC 2002»
13 years 9 months ago
Efficient Interval Linear Equality Solving in Constraint Logic Programming
Existing interval constraint logic programming languages, such as BNR Prolog, work under the framework of interval narrowing and are deficient in solving systems of linear constrai...
Chong-Kan Chiu, Jimmy Ho-Man Lee
TLCA
1997
Springer
14 years 1 months ago
Coinductive Axiomatization of Recursive Type Equality and Subtyping
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
Michael Brandt, Fritz Henglein
EKAW
1992
Springer
14 years 1 months ago
eQuality: An Application of DDucks to Process Management
Process management is a method for improving Boeing's business processes, however many aspects have been difficult to implement. eQuality is a software system based on a frame...
Jeffrey Bradshaw, Peter Holm, Oscar Kipersztok, Th...
RTA
2005
Springer
14 years 3 months ago
The Algebra of Equality Proofs
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is an axiom proving x=x for any x; symmetry is a 1-p...
Aaron Stump, Li-Yang Tan