Sciweavers

476 search results - page 49 / 96
» Esfinge a Question Answering System in the Web using the Web
Sort
View
HIPC
2007
Springer
13 years 11 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
13 years 7 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri
ACMICEC
2006
ACM
191views ECommerce» more  ACMICEC 2006»
14 years 1 months ago
An ontology of trust: formal semantics and transitivity
This paper formalizes the semantics of trust and studies the transitivity of trust. On the Web, people and software agents have to interact with “strangers”. This makes trust ...
Jingwei Huang, Mark S. Fox
HT
2009
ACM
14 years 2 months ago
Comparing the performance of us college football teams in the web and on the field
In previous research it has been shown that link-based web page metrics can be used to predict experts’ assessment of quality. We are interested in a related question: do expert...
Martin Klein, Olena Hunsicker, Michael L. Nelson
DKE
2008
114views more  DKE 2008»
13 years 7 months ago
Proof explanation for a nonmonotonic Semantic Web rules language
In this work, we present the design and implementation of a system for proof explanation in the Semantic Web, based on defeasible reasoning. Trust is a vital feature for Semantic ...
Grigoris Antoniou, Antonis Bikakis, Nikos Dimaresi...