Sciweavers

8780 search results - page 198 / 1756
» On the Feasibility of Consistent Computations
Sort
View
CSR
2006
Springer
15 years 11 months ago
Logic of Proofs for Bounded Arithmetic
The logic of proofs is known to be complete for the semantics of proofs in PA. In this paper we present a refinement of this theorem, we will show that we can assure that all the ...
Evan Goris
CAAP
1990
15 years 10 months ago
Petri Nets as Models of Linear Logic
The chief purpose of this paper is to appraise the feasibility of Girard’s linear logic as a specification language for parallel processes. To this end we propose an interpreta...
Uffe Engberg, Glynn Winskel
CONEXT
2005
ACM
15 years 9 months ago
Triggering wireless network flashes
— Recent advances in wireless technology make high data rate communication in short ranges feasible. The network instances of short-range paths that may achieve high data rates a...
Athanasios Vaios, Ioannis Stavrakakis
214
Voted
ACL
2012
13 years 9 months ago
Word Epoch Disambiguation: Finding How Words Change Over Time
In this paper we introduce the novel task of “word epoch disambiguation,” defined as the problem of identifying changes in word usage over time. Through experiments run using...
Rada Mihalcea, Vivi Nastase
DAC
2004
ACM
16 years 8 months ago
Accurate pre-layout estimation of standard cell characteristics
With the advent of deep-submicron technologies, it has become essential to model the impact of physical/layout effects up front in all design flows [1]. The effect of layout paras...
Hiroaki Yoshida, Kaushik De, Vamsi Boppana