Sciweavers

657 search results - page 70 / 132
» Implementing Matching in ALE--First Results
Sort
View
DAGSTUHL
1990
13 years 8 months ago
Integrating Rules and Connectionism for Robust Reasoning
A connectionist model for robust reasoning, CONSYDERR, is proposed to account for some common reasoning patterns found in commonsense reasoning and to remedy the brittleness probl...
Ron Sun
CSJM
2006
124views more  CSJM 2006»
13 years 7 months ago
Text Classification Using Word-Based PPM Models
Text classification is one of the most actual among the natural language processing problems. In this paper the application of word-based PPM (Prediction by Partial Matching) mode...
Victoria Bobicev
IJIPT
2006
58views more  IJIPT 2006»
13 years 7 months ago
On protocol engineering: detect, confirm and adjust
: In this paper, we depart from TCP-Probing (Tsaoussidis and Badr, 2000) and propose an experimental transport protocol that achieves energy and throughput performance gains in mix...
Ioannis Psaras, Lefteris Mamatas, Vassilis Tsaouss...
JPDC
2006
92views more  JPDC 2006»
13 years 7 months ago
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
In distributed shared memory multiprocessors, remote memory references generate processor-to-memory traffic, which may result in a bottleneck. It is therefore important to design ...
Sheng-Hsiung Chen, Ting-Lu Huang
DEBS
2011
ACM
12 years 11 months ago
Declarative data-driven coordination
Many data-driven social and Web applications involve collaboration and coordination. The vision of declarative data-driven coordination (D3C), proposed in [9], is to support coord...
Johannes Gehrke