Sciweavers

2214 search results - page 227 / 443
» Complexity of Reasoning
Sort
View
129
Voted
PRICAI
2004
Springer
15 years 9 months ago
An Anytime Algorithm for Interpreting Arguments
Abstract. The problem of interpreting Natural Language (NL) discourse is generally of exponential complexity. However, since interactions with users must be conducted in real time,...
Sarah George, Ingrid Zukerman, Michael Niemann
VOSS
2004
Springer
135views Mathematics» more  VOSS 2004»
15 years 9 months ago
Analysing Randomized Distributed Algorithms
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...
Gethin Norman
WWW
2010
ACM
15 years 9 months ago
Keyword search over key-value stores
Key-value stores (KVSs) are the most prevalent storage systems for large scale web services. As they do not have the structural complexities of RDBMSs, they are more efficient. In...
Arash Termehchy, Marianne Winslett
85
Voted
DATE
2003
IEEE
75views Hardware» more  DATE 2003»
15 years 9 months ago
Circuit and Platform Design Challenges in Technologies beyond 90nm
There are already a huge number of problems for silicon designers and it is likely to just get worse. Many of these problems are technical associated with shrinking geometries and...
Bill Grundmann, Rajesh Galivanche, Sandip Kundu
133
Voted
HICSS
2003
IEEE
125views Biometrics» more  HICSS 2003»
15 years 9 months ago
Verifying Trustworthiness Requirements in Distributed Systems with Formal Log-file Analysis
The paper reports on an analysis technology based on the tracing approach to test trustworthy requirements of a distributed system. The system under test is instrumented such that...
Andreas Ulrich, Hesham Hallal, Alexandre Petrenko,...