Sciweavers

5084 search results - page 353 / 1017
» Proving Possibility Properties
Sort
View
ALP
1997
Springer
15 years 11 months ago
Perpetuality and Uniform Normalization
We de ne a perpetual one-step reduction strategy which enables one to construct minimal (w.r.t. Levy's ordering 2 on reductions) in nite reductions in Conditional Orthogonal ...
Zurab Khasidashvili, Mizuhito Ogawa
COCO
1997
Springer
144views Algorithms» more  COCO 1997»
15 years 11 months ago
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
Kenneth W. Regan
184
Voted
INFOCOM
1994
IEEE
15 years 11 months ago
A Self-Clocked Fair Queueing Scheme for Broadband Applications
A n eficient fair queueing scheme which is feasible for broadband implementation is proposed and its performance is analyzed. We define fairness in a selfcontained manner, elimina...
S. Jamaloddin Golestani
CCL
1994
Springer
15 years 10 months ago
On Modularity in Term Rewriting and Narrowing
We introduce a modular property of equational proofs, called modularity of normalization, for the union of term rewrite systems with shared symbols. The idea is, that every normali...
Christian Prehofer
CHI
1993
ACM
15 years 10 months ago
A design space for multimodal systems: concurrent processing and data fusion
Multimodal interaction enables the user to employ different modalities such as voice, gesture and typing for communicating with a computer. This paper presents an analysis of the ...
Laurence Nigay, Joëlle Coutaz