Sciweavers

1389 search results - page 33 / 278
» Definability as hypercomputational effect
Sort
View
TACS
1994
Springer
14 years 21 days ago
Full Abstraction for PCF
traction for PCF1 Samson.Abramsky2 University of Edinburgh and Radha Jagadeesan3 Loyola University Chicago and Pasquale Malacaria4 Queen Mary and Westfield College An intensional m...
Samson Abramsky, Pasquale Malacaria, Radha Jagadee...
ICDCSW
2008
IEEE
14 years 3 months ago
Heuristic Relay Node Selection Algorithm for One-Hop Overlay Routing
—This paper reviews the characteristics of overlay networks and defines effective relay nodes that can improve the performance of interactive real-time applications. A heuristic ...
Yin Chen, Li Tang, Jun Li
COLING
2000
13 years 10 months ago
A Method of Measuring Term Representativeness - Baseline Method Using Co-occurrence Distribution
This paper introduces a scheme, which we call the baseline method, to define a measure of term representativeness and measures defined by using the scheme. The representativeness ...
Toru Hisamitsu, Yoshiki Niwa, Jun-ichi Tsujii
ATAL
2003
Springer
14 years 1 months ago
A Dialectic Architecture for Computational Autonomy
This paper takes the view that to be considered autonomous, a software agent must possess the means by which to manage its own motivations and so define new goals. Using the motiva...
Mark Witkowski, Kostas Stathis
GRC
2009
IEEE
13 years 12 months ago
A step toward code granulation space
This paper proposes a code granulation space which can be applied to program construction and processing. Each granule in the space is defined as an improvement to the seed progra...
Yinliang Zhao