Sciweavers

500 search results - page 10 / 100
» On the Hardness of Being Truthful
Sort
View
RTSS
1996
IEEE
13 years 11 months ago
Integrated scheduling of multimedia and hard real-time tasks
An integrated platform which is capable of meeting the requirements of both traditional real-time control processing and multimedia processing has enormous potential for accommoda...
Hiroyuki Kaneko, John A. Stankovic, Subhabrata Sen...
ICALP
1998
Springer
13 years 11 months ago
Difficult Configurations - On the Complexity of LTrL
The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also ca...
Igor Walukiewicz
IPPS
2006
IEEE
14 years 1 months ago
Schedulability analysis of AR-TP, a Ravenscar compliant communication protocol for high-integrity distributed systems
A new token-passing algorithm called AR-TP for avoiding the non-determinism of some networking technologies is presented. This protocol allows the schedulability analysis of the n...
Santiago Urueña, Juan Zamorano, Daniel Berj...
COCO
2001
Springer
107views Algorithms» more  COCO 2001»
13 years 12 months ago
In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...
SIGIR
2012
ACM
11 years 9 months ago
TwiNER: named entity recognition in targeted twitter stream
Many private and/or public organizations have been reported to create and monitor targeted Twitter streams to collect and understand users’ opinions about the organizations. Tar...
Chenliang Li, Jianshu Weng, Qi He, Yuxia Yao, Anwi...