Sciweavers

1235 search results - page 150 / 247
» Structured Meanings in Computational Linguistics
Sort
View
WDAG
1995
Springer
109views Algorithms» more  WDAG 1995»
15 years 1 months ago
Faster Possibility Detection by Combining Two Approaches
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...
Scott D. Stoller, Fred B. Schneider
CORR
2008
Springer
98views Education» more  CORR 2008»
14 years 10 months ago
Does intelligence imply contradiction?
Contradiction is often seen as a defect of intelligent systems and a dangerous limitation on efficiency. In this paper we raise the question of whether, on the contrary, it could ...
Patrizio Frosini
JODS
2007
119views Data Mining» more  JODS 2007»
14 years 9 months ago
Semantic Matching: Algorithms and Implementation
We view match as an operator that takes two graph-like structures (e.g., classifications, XML schemas) and produces a mapping between the nodes of these graphs that correspond sema...
Fausto Giunchiglia, Mikalai Yatskevich, Pavel Shva...
IPPS
2002
IEEE
15 years 2 months ago
Load Balancing in Distributed Systems: An Approach Using Cooperative Games
In this paper we formulate the static load balancing problem in single class job distributed systems as a cooperative game among computers. It is shown that the Nash Bargaining So...
Daniel Grosu, Anthony T. Chronopoulos, Ming-Ying L...
ISWC
1999
IEEE
15 years 2 months ago
Virtual Information Towers-A Metaphor for Intuitive, Location-Aware Information Access in a Mobile Environment
This paper introduces Virtual Information Towers (VITs) as a concept for presenting and accessing location-aware information with mobile clients. A VIT is a means of structuring l...
Alexander Leonhardi, Uwe Kubach, Kurt Rothermel, A...