Sciweavers

1147 search results - page 198 / 230
» Termination in language-based systems
Sort
View
IGPL
1998
97views more  IGPL 1998»
13 years 9 months ago
Towards Structurally-Free Theorem Proving
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
Marcelo Finger
NETWORK
2007
87views more  NETWORK 2007»
13 years 9 months ago
Resource Management for Broadband Access over Time-Division Multiplexed Passive Optical Networks
Passive optical networks are a prominent broadband access solution to tackle the “last mile” bottleneck in telecommunications infrastructure. Data transmission over standardiz...
Yuanqiu Luo, Si Yin, Nirwan Anson, Ting Wang
PERSUASIVE
2010
Springer
13 years 8 months ago
Animate Objects: How Physical Motion Encourages Public Interaction
The primary challenge for information terminals, kiosks, and incidental use systems of all sorts, is that of getting the “first click” from busy passersby. This paper presents ...
Wendy Ju, David Sirkin
VTC
2010
IEEE
114views Communications» more  VTC 2010»
13 years 8 months ago
On Non-Stationary Urban Macrocell Channels in a Cooperative Downlink Beamforming Scenario
—A common simplification in the treatment of random linear channels is the assumption of stationarity of the channel in time. The wireless channel is, however, known to be inher...
Adrian Ispas, Gerd Ascheid, Christian Schneider, R...
JELIA
2010
Springer
13 years 7 months ago
Tabling with Answer Subsumption: Implementation, Applications and Performance
Tabled Logic Programming (TLP) is becoming widely available in Prolog systems, but most implementations of TLP implement only answer variance in which an answer A is added to the t...
Terrance Swift, David Scott Warren