Sciweavers

1533 search results - page 202 / 307
» Semantic Matching: Algorithms and Implementation
Sort
View
WDAG
2010
Springer
216views Algorithms» more  WDAG 2010»
13 years 7 months ago
A Scalable Lock-Free Universal Construction with Best Effort Transactional Hardware
The imminent arrival of best-effort transactional hardware has spurred new interest in the construction of nonblocking data structures, such as those that require atomic updates to...
Francois Carouge, Michael F. Spear
EDCC
2005
Springer
14 years 3 months ago
Failure Detection with Booting in Partially Synchronous Systems
Unreliable failure detectors are a well known means to enrich asynchronous distributed systems with time-free semantics that allow to solve consensus in the presence of crash failu...
Josef Widder, Gérard Le Lann, Ulrich Schmid
SOFSEM
2000
Springer
14 years 1 months ago
Towards High Speed Grammar Induction on Large Text Corpora
Abstract. In this paper we describe an e cient and scalable implementation for grammar induction based on the EMILE approach ( 2], 3], 4], 5], 6]). The current EMILE 4.1 implementa...
Pieter W. Adriaans, Marten Trautwein, Marco Vervoo...
CONSTRAINTS
2002
143views more  CONSTRAINTS 2002»
13 years 9 months ago
A Constraint-Based Robotic Soccer Team
It is a challenging task for a team of multiple fast-moving robots to cooperate with each other and to compete with another team in a dynamic, real-time environment. For a robot te...
Yu Zhang, Alan K. Mackworth
WWW
2008
ACM
14 years 10 months ago
Scalable querying services over fuzzy ontologies
Fuzzy ontologies are envisioned to be useful in the Semantic Web. Existing fuzzy ontology reasoners are not scalable enough to handle the scale of data that the Web provides. In t...
Jeff Z. Pan, Giorgos B. Stamou, Giorgos Stoilos, S...